# Problem Set 9: Sorting

Write a C program that declares an integer array length of one hundred (100) and initializes the array with ten (10) values. Then do the following operations. \[NB: Use Function] \[Write each program in a different file. The file name will be the problem number

1. Selection Sort Iterative
   1. Implement iterative selection sort in ascending order. (use minimum value for selection)
   2. Implement iterative selection sort in ascending order. (use maximum value for selection)
   3. Implement iterative selection sort in descending order. (use minimum value for selection)
   4. Implement iterative selection sort in descending order. (use maximum value for selection)
2. Selection Sort Recursive
   1. Implement recursive selection sort in ascending order. (use minimum value for selection)
   2. Implement recursive selection sort in ascending order. (use maximum value for selection)
   3. Implement recursive selection sort in descending order. (use minimum value for selection)
   4. Implement recursive selection sort in descending order. (use maximum value for selection)
3. Insertion Sort
   1. Implement iterative insertion sort in ascending order.
   2. Implement iterative insertion sort in descending order.
   3. Implement recursive insertion sort in ascending order.
   4. Implement recursive insertion sort in descending order.
4. Bubble Sort
   1. Implement iterative bubble sort in ascending order.
   2. Implement iterative bubble sort in descending order.
   3. Implement recursive bubble sort in ascending order.
   4. Implement recursive bubble sort in descending order.
