You need to prepare a program to implement the quick sort algorithm
Write a c program to experimentally compare the O() coplexities of:
Part 1- the provided quick sort algorithm, and
Part 2- your bubble sort algorithm.
Plot the time-results of at least nine samples: starting fron 1 million elements, to nine millions elements arrays
Plotting must be done by the program: using the clock() library function as has been described in class. Hints: it is easier to put the times horizontally (x-axis), and the sample sizes (n) down (y-axis) and the two curves are to be using (.) and (*) for distinction between the two algorithms.
You need to make well-formed and clean code. You should not copy and paste the code from other source.