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
Leggi tutto... (http://blog.intelly-net.com/java/algorithm/quick-sort-algorithm-with-java-and-r.html)
↧