python coding

Here is the skeleton of the code with key portions for the students to fill in$.$

code

#include

$//$ Function prototypes

void quicksort$($int arr$[],$ int low, int high$)$;

int partition$($int arr$[],$ int low, int high$)$;

int main$()\{$

$//$ Sample array to be sorted

$$ int arr$[]=\{37,2,6,4,89,8,10,12,68,45\}$;

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

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

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

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

$\}$

$$ printf$("$

$")$;

$//$ Call quicksort function

$$ quicksort$($arr$,0,$ size $-1)$;

$//$ Display the sorted array

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

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

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

$\}$

$$ printf$("$

$")$;

$$ return $0$;

$\}$

$//$ Implement the quicksort function

void quicksort$($int arr$[],$ int low, int high$)\{$

$$ if $($low $<$ high$)\{$

$//$ Call partition function to partition the array

$$ int pivotIndex $=$ partition$($arr$,$ low, high$)$;

$//$ Recursively sort elements before and after the pivot

$//[$Insert code here to recursively call quicksort on subarrays$]$

$\}$

$\}$

$//$ Implement the partition function

int partition$($int arr$[],$ int low, int high$)\{$

$//$ Use the first element as the pivot

$$ int pivot $=$ arr$[$low$]$;

$$

$//[$Insert logic for partitioning based on the pivot$]$

$//$ Return the final position of the pivot

$\}$

Guidelines:

Fill in the partition function:

Use the logic described in the problem statement to swap elements based on the pivot. Alternate between scanning from the right and the left to find elements to swap.

Complete the quicksort function:

After partitioning the array, call the quicksort function recursively on both the subarray to the left of the pivot and the subarray to the right.

Test your implementation:

Use the provided test array in main and observe how it is sorted. Print the array at different steps if necessary to trace the execution.

Conclusion

When your work is complete, please upload to Canvas