software research, design, architecture

Algorithm description Quick description Quick sort is an algorithm to sort elements (we will use a vector) In short, the procedure for sorting is done in this way: i take a vector's element (the pivot) (for example the first element of the vector) and then i move the pivot and all the elements, with value less than the value of pivot, at left of the pivot and all the elements, with value more hight, to the right of the pivot. In this way i have the pivot in a position where at its left there are all the element of less value and at right, all the element with value more hight. So the pivot is an element just sorted in the vector. It's just in the right position. Now i can see the array as made by three elements. The pivot, the left sub vector and the right sub vector. So i can apply the same algorithm to the left sub vector and the right sub vector. This process is iterated in each sub vector until all the elements are sorted As you can see this algorithm use divide...