Example usage of Quick sort algorithm in python
This article mainly explains "the example usage of the quick sort algorithm in python". The content of the article is simple and clear, and it is easy to learn and understand. Please follow the editor's train of thought to study and learn "the example usage of the quick sort algorithm in python".
1. Select the most basic number N of the last element in the list, before the release of less than N, and after the release of greater than or equal to N.
2. Take the last number in front of you as the benchmark and place it as above.
3. Until the marks of each part are equal, the quick sort is completed.
Example
Def move_num (my_list, low, high): n = my_ list [high] # determine the base N move = low-1 # start for i in range (low, high): if my_ list [I] from the left minus 1
