Atitit. The best sorting method in real life ----- ATI sorting summary

Atitit. The best sorting method in real life ----- ATI sorting summary

 

1. Question 1

2. Sorting category: insert sorting // switch sorting // select sorting (the smallest or largest sorting is in the corresponding position each time) // Merge Sorting // base sorting 1

3. Select sorting method (junk... not easy to use) 2

4. Heap sorting-(ya 10 garbage... not easy to use) 2

5. Hill sorting method (ya 10 garbage... not easy to use) 3

6. Bubble sorting method (ya 10 garbage... not easy to use) 3

7. Quick sorting method (yazhi garbage... not easy to use) 3

8. Merge Sorting method (yazhi garbage... not easy to use) 3

9. Insert sorting method (barely usable, if you add 2 points to search for OK...) 3

10. Base Sorting/bucket sorting (unavailable) 3

11. Shell sorting-reduce the increment (not easy to use) 3

12. topological sorting (unavailable) 3

13. Tournament sorting (poor) 3

14. ATI sorting (preferably) 3

15. Reference 3

 

 

1. Current Problems

A book with more than 100 pages is now scattered. How can we sort the best simple and fast ???

 

I thought of the sorting algorithm, and tried to give it to the hook...

 

 

2. Sorting category: insert sorting // switch sorting // select sorting (the smallest or largest sorting is in the corresponding position each time) // Merge Sorting // base sorting

Merge Sorting

Principle: divide the original sequence into two ordered sequences, and merge them using the merge algorithm. after merging, the original sequence is an ordered sequence.

Base sort

Author: old wow's paw attilax iron, email: [email protected]

Reprinted please indicate Source: http://blog.csdn.net/attilax

 

 

 

1. Insert sort directly (insert sort)

2. Hill sorting (insert sorting)

Bubble sort -- (exchange sort)

Fast sorting -- (exchange sorting)

Select sort --- (select sort)

Heap sorting --- (select sorting)

 

3. Select sorting method (junk... not easy to use)

Selection sort is a simple and intuitive sorting algorithm. It works as follows. First, find the smallest (large) element in the unordered sequence, store it to the starting position of the sorting sequence, and then continue searching for the smallest (large) element from the remaining unordered elements, put it at the end of the sorted sequence. And so on until all elements are sorted.

 

4. Heap sorting-(ya 10 garbage... not easy to use) 5. Hill sorting method (ya 10 garbage... not easy to use)

Hill sorting, also known as the descending incremental sorting algorithm, is a more efficient improved version of insert sorting. Hill sorting is a non-stable sorting algorithm.

Interchange between the left and right...

6. Bubble sorting method (ya 10 garbage... not easy to use) 7. Quick sorting method (ya 10 garbage... not easy to use)

Fast sorting is a sort algorithm developed by Tony Hall.

8. Merge Sorting method (yazhi garbage... not easy to use)

Merge sort

9. Insert sorting method (barely usable, if you add 2 points to search for OK ..)

The description of insertion sort is a simple and intuitive sorting algorithm.

10. base Sorting/bucket sorting (unavailable) 11. shell sorting-reduce the increment (not useful) 12. topological sorting (unavailable) 13. tournament sorting (difficult to use) 14. ATI sorting (preferably)

Sort by insert, but use 2 points for search

 

15. Reference

Tutorial video on sorting algorithms that drive programmers crazy _ It comments .htm

Summary of the eight sorting algorithms-yexinghai column-blog channel-csdn.net.htm

Eight sorting algorithms-guisu, program life. -Blog channel-csdn.net.htm

Summary of 10 sorting algorithms-Java programming language program development technical articles-red/Black Union .htm