Time sharing based multithreading approach to Quicksort

Thread based programs are known to increase the efficiency of complex operations. Threading eases a load of GUI thread (main thread) thus improving the performance of the system. Keeping the above features of threading in mind, the present study focusses on multi-threaded based quick sort and is compared with sequential quick sort. Multithreading quick sort has shown greater efficiency over sequential quick sort and the results are validated using various performance metrics like % idle time, % maximum frequency, % processor utility, % processor time and total execution time.