重温经典排序思想--c语言常用排序全解（Review classic sorting ideas, --c language, commonly used sorting complete solution）.doc

重温经典排序思想--c语言常用排序全解（Review classic sorting ideas, --c language, commonly used sorting complete solution） Review classic sorting ideas, --C language, commonly used sorting, full selection, since the rerli Blog Keyword selection, sort, direct insertion, sort, bubble sort, Hill sort, quick sort, heap sort Source * =============================================== Author: rerli Time: 2003-12-15 Objective: To review the classical sorting idea and to implement the sorting algorithm with the pointer of C language ================================================ * / * ============================================================================= Related knowledge (all definitions are intended only to help readers understand relevant concepts, not strictly defined): 1, stable sorting and unstable sorting Simply put, all equal numbers can still keep their relative order before they are sorted by some sort of sorting method This sort of sorting method is stable. On the other hand, it is unstable. For example: a set of numbers sorted before A1, A2, A3, A4, A5,, where a2=a4, after some sort of A1, A2, A4, A3, a5, We say that this sort of ordering is stable, because the A2 is sorted before A4, and after sorting, it is still in front of a4. If it becomes A1, a4, A2, A3, A5 arent stable anymore. 2, internal sorting and external sorting In the sorting process, all the numbers that need to be sorted are in memory, and their storage order is adjusted in memory, called intra sorting; In the sorting process, only part of the number is transferred to memory, and the memory adjustment in the file memory storing order sorting method called external sorting. 3, the time complexity and space complexity of the algorithm The time complexity of the algorithm refers to the amount of computation required to perform the algorithm. The spatial complexity of an algorithm, in general, refers to the memory space needed to perform this algorithm. ===========================================================