Difference Between Stripper

Extra Points "Quick Sort"

Definition:

system Quick Sort Quick sort is an algorithm that not only helps us to organize a list of unorganized data, but also to optimize the time is engaged in undertaking this work, since it allows direct " n" elements in a running time O (n log n) , which is very efficient.

Algorithm:

this function management system in a disorganized data list to choose a pivot , which can be chosen at random, but I think more convenient, to choose one that is in the middle, then send all items with value less than the next pivot and all left over the right side:

< pivote =" Izquierda element

item> pivot = Right

After

starts sort of left all the elements under the pivot in a recursive manner until they are sorted and so the right side, to the point where both sides are and order and consequently the entire list.

Example: (Dar click the word example to see it)

• is an unordered list which is represented by bars of different sizes.
• The algorithm first chooses a pivot.
• After the rest of the items evaluates them, so those who are less than the pivot the left side and sent the biggest of the right side.
• ago each side the same thing to them recursivamnte in order.
• And in the end as each side of the pivot is ordered then we would be a list in order.

To serve me??

Well to me personally, this algorithm is very useful because it allows me to organize data so that I can enlist sort a list of priorities to do, which saves me time and effort, but I think my career is an algorithm that I will be very useful, since there are multiple applications for this, as do programs that I organize certain data, which depends on the data sorted to obtain a result and if this results in what I can get a better time for me would be very useful use, an example would be, that when entering certain data (in disorder) have to take the median (Statistics) , then here would come to apply this algorithm very well.

Application to my daily life:

I am working on some music tapes, Audio Scream, and although not creean this algorithm "Quick Sort" is applicable here, and the team apparatus with which we differ from each other in weight and size, and moved by a truck, we have sufficient equipment to deal with 3 events at once:

Team:

• Gennie 2 Elevators.
• 2 JBL Netherlands.
• 8 Cerwin-Vega Bass.
• Peripheral 3.
• tip type 2 structures (and accessories).
• 4 white lights (Cabezas Mobiles).
• 10 Lights Black Power Spot (Cabezas Mobiles).
• 2 Load Centers.
• Technobeam 10 Lights.
• Speakers Mackie 12.
• Dj Turntables 3 (2 and 1 Denon Mixer c / u).
• 3 smoke machines.
• 2 Laptops.
• 3 Interfaces.
• Wiring (Extensions, Canon cables, AC power , etc).

* The list of equipment is ordered to form to its weight and size *

So sometimes it is necessary to lower the truck only low or no more than a structure or anything but cable, etc. . so if you put everything into the truck disorganized, besides that would not fit well, the time to draw something specific, we would first seek more time where it is and then move everything to get him out before, with the Quick Sort algorithm we avoid all these mishaps, so that before team up to the truck, we could accommodate as the weight and size, a heavier and deeper and larger among the more light and small forward. This way we know that if we get a bass Cerwin-Vega would know that the bottom or if we get a rac of lights, this will be in the middle, so we would know to move or lower to reach the target.

Video

Explanation:
The video shows the comparison of the method vs. Quick Sort. Bubble Sort (Bubble Land) both are sorting algorithms, but clearly shows that the Quick Sort is more efficient, ie it is faster and more functional, as the Quick Sort algorithm does the same task in fewer steps so sooner. In conclucion the Quick Sort algorithm is optimized in ordenaminento.