a) A structure chart, including the passed data representation
b) A list of functions that will be implemented. For each function, include:
- The function name
- A description of the task the function will perform
- The function parameters and return values
- Which team member will be implementing the function
Note: An easy way to create the function list is by using the documentation headers from the coding standards for each function you will need, with an IMPLEMENTED BY: line added.
This material may consist of step-by-step explanations on how to solve a problem or examples of proper writing, including the use of citations, references, bibliographies, and formatting. This material is made available for the sole purpose of studying and learning - misuse is strictly forbidden.Global Constants
const int LIST_SIZE = 100000;
const int MIN_INT_BOUND = 1;
const int MAX_INT_BOUND = 30000;
Static global array
static int tempList [LIST_SIZE];
// IMPLEMENTED BY: Haenel
1) function: main
2) function: SelectionSort
description: repeatedly find the next smallest element in the array and move it to its final position in the sorted array
input: int list
return: sorted array
3) function: Partition...
By purchasing this solution you'll be able to access the following files:
Solution.jpg and Solution.txt.