What Is Memory Ordering?

Internal sorting is a sorting algorithm in which all sorted data elements are stored in computer memory.

Adjust the relative position of data elements in memory to make them orderly. Suitable for situations where the number of data elements is small.

Common methods are insert sort, select sort, swap sort, and merge sort. If the key value is an integer, you can also use radix sort. ^[2]

There are many internal sorting methods. According to different sorting methods, they can be divided into multiple sorting methods such as insert sorting, swap sorting, selection sorting, merge sorting, and radix sorting. These sorting methods have their own advantages and disadvantages. In practice, reasonable selection should be made according to the specific situation, and a more efficient sorting method should be written. ^[1]