/* * Selection sort is a sorting algorithim that works by partitioning the array into * a sorted section and unsorted section. Then it repeatedly selects the minimum element * from the unsorted section and moves it to the end of the sorted section. * * So the pseudo-code might look something like this: * arr - an array * n - the length of arr * * * for i = o to n - 1 minIndex = i for j = i + 1 ton if arr[minIndex] > arr[j] minIndex = j end if end for Swap(arr[i], arr[minIndex]) * end for * * Implement selection sort below, it might be helpful to use the swapInts functi * defined earlier. you * * ALLOWED : Pointer operators: *, & * Binary integer operators: -, +, *, ==, !=, <, > Unary integer operators: ! Shorthand operators based on the above: ex. +, *=, ++,--, etc. Control constructs: for, while, if Function calls: swap Int(). * * * * * DISALLOWED: Pointer operators: [] (Array Indexing Operator) Binary integer operators: &, &&, l, ll<<, >>, ^, Unary integer operators: ~, */ void selection Sort(int arr[], int arrLength) { int i, j, min_index;
// Your code here
}