C Programming

Function Definition:

Write a recursive function selectionSort that takes an integer array, the starting index, and the array$$s size as parameters.

Base Case:

The base case occurs when the starting index is equal to the size of the array minus one, meaning that the array is sorted.

Recursive Case:

The function should:

Find the smallest element in the subarray starting at the current index.

Swap that element with the current index element.

Recursively call selectionSort on the subarray that excludes the sorted portion.

Swap Function $($Optional$)$:

You may implement a helper function to handle the swapping of two elements in the array.

Code I have so far

#include

$//$ Function prototypes

void selectionSort$($int arr$[],$ int start, int size$)$;

int main$()\{$

$//$ Sample array to be sorted

int arr$[]=\{64,25,12,22,11\}$;

int size $=$ sizeof$($arr$)/$ sizeof$($arr$[0])$;

$//$ Display original array

printf$("$Original array: $")$;

for $($int i $=0$; i $<$ size; i$++)\{$

printf$("\%$d $",$ arr$[$i$])$;

$\}$

printf$("$

$")$;

$//$ Call selectionSort

selectionSort$($arr$,0,$ size$)$;

$//$ Display sorted array

printf$("$Sorted array: $")$;

for $($int i $=0$; i $<$ size; i$++)\{$

printf$("\%$d $",$ arr$[$i$])$;

$\}$

printf$("$

$")$;

return $0$;

$\}$

$//$ Implement the recursive selection sort function

void selectionSort$($int arr$[],$ int start, int size$)\{$

if $($start $<$ size $-1)\{$

$//$ Find the index of the smallest element in the subarray

$//$ Swap the smallest element with the current element $($arr$[$start$])$

$//[$Insert recursive call here$]$

$\}$

$\}$