Write a C /C++ program with a divide-and-conquer algorithm
Write a C /C++ program with a divide-and-conquer algorithm that finds the two indices (i and j, 1 <= i <=
j <= n) in an array of integers with the maximum sum of contiguous elements. For example, if the
array elements are: 2, 18, -22, 20, 8, -6, 10 -24, 13, 3, then the returned indices should be i=4 and
j=7.
for example,
Input: 2, 18, -22, 20, 8, -6, 10 -24, 13, 3,Â
Output:Â
Maximal sub array : I = 4 and j =
Â
Â
Â
INFSCI 2591: Algorithm Design
Project 1
Due: February 7, 2017
Write a program with a divide-and-conquer algorithm that finds the two indices (i and j, 1 <= i <=
j <= n) in an array of integers with maximum sum of contiguous elements. For example, if the
array elements are: 2, 18, -22, 20, 8, -6, 10 -24, 13, 3, then the returned indices should be i=4 and
j=7.
Submit your project in a single PDF file on courseweb. The file must include: (1) a pseudocode
for the algorithm and (2) the results of the program for several tests (your program must be tested
by using the test cases provided in courseweb). You should also submit the source code for the
program in one separate zip file.
Points
Pseudocode
Correct algorithm (handling all test cases)
Source code
Code readability/documentation 10
60
20
10 Total: 100
Attachments:
Answers
Status NEW
Posted 04 May 2017 02:05 AM
My Price 9.00
-----------
Attachments
file 1493865009-Solutions file 2.docx preview (51 words )
H-----------ell-----------o S-----------ir/-----------Mad-----------am
-----------
Th-----------ank----------- yo-----------u f-----------or -----------you-----------r i-----------nte-----------res-----------t a-----------nd -----------buy-----------ing----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n. -----------Ple-----------ase----------- pi-----------ng -----------me -----------on -----------cha-----------t I----------- am----------- on-----------lin-----------e o-----------r i-----------nbo-----------x m-----------e a----------- me-----------ssa-----------ge -----------I w-----------ill----------- be----------- qu-----------ick-----------ly -----------onl-----------ine----------- an-----------d g-----------ive----------- yo-----------u e-----------xac-----------t f-----------ile----------- an-----------d t-----------he -----------sam-----------e f-----------ile----------- is----------- al-----------so -----------sen-----------t t-----------o y-----------our----------- em-----------ail----------- th-----------at -----------is -----------reg-----------ist-----------ere-----------d o-----------n -----------THI-----------S W-----------EBS-----------ITE-----------.
-----------
Th-----------ank----------- yo-----------u
-----------
Not Rated(0)