北京邮电大学 计算机学院 离散数学 3.1- Algorithms.pptVIP

* * College of Computer Science Technology, BUPT Smallest elements “float” up to the top of the list, like bubbles in a container of liquid. Bubble Sort 30 31 1 32 33 2 34 3 30 1 31 32 2 33 3 34 1 30 31 2 32 3 33 34 1 30 2 31 3 32 33 34 1 2 30 3 31 32 33 34 1 2 3 30 31 32 33 34 * * College of Computer Science Technology, BUPT Insertion Sort Algorithm English description of algorithm: For each item in the input list, “Insert” it into the correct place in the sorted output list generated so far. Like so: Use linear or binary search to find the location where the new item should be inserted. T