HOMEWORK > HW2 Solution New York University ECE-GY 9343
New York University ECE-GY 9343 1. For the maximum subarray problem, if we use divide-conquer, but instead of dividing the array into two halves, we equally divide it into three segments, how should the algorithm be modified? What is the running time of the new algorithm? Solution: If we divide the original array A into 3 equal-sized sub-arrays S1, S2, and S3, we have 3 c ...[Show More]
Preview 1 out of 8 pages
Reviews( 0 )
| Category: | HOMEWORK |
| Number of pages: | 8 |
| Language: | English |
| Last updated: | 1 year ago |
| Downloads: | 1 |
| Views: | 1 |
-preview.png)
-preview.png)
-preview.png)
