This project is a very great example for Quick_sorting algorithm. If you have a little bit of programming knowledge, you can write this code in any programming language. also I explained how this code works.
This algorithm is really fast and easy!
first of all we chose an element (r)(last one but no difference) then sort dvide other elements by 2 group: 1. less than r, 2. more than r;
with recursion we do this function over and over till we have an array(not an new array, just two indexes) which has 2 sorted element and then we have a sorted array.
Expected value: T = θ(nlogn)
Worst run time: T = θ(n^2)
(n is number of elements and T is not necessarily seconds)
That's so simple! there is a tester file you can use!
compiled in Java16.
Code and Design By Eng.Parsa Gh (Bu64p)