`!_`5 81_09

Algorithm RAlgorithm R (Radix list sort). Records R1,…, RN are each assumed to contain a LINK field. Their keys are assumed to be p-tuples (a1,a2,…,ap),

Algorithm LAlgorithm L (List merge sort). Records R1, … , RN are assumed to contain keys K1,…, KN, together with link fields L1, …, LN capable of holding the numbers -(N + 1) through (N + 1). There

Algorithm RAlgorithm R (Radix exchange sort). Records R1,… ,RN are rearranged in place; after sorting is complete, their keys will be in order, K1 <= … <= KN. Each key is assumed to be a nonnegativ

Algorithm SAlgorithm S (Straight two-way merge sort). Records R1,… ,RN are sorted using two memory areas as in Algorithm N. S1. [Initialize.] Set s <– 0, p <– 1. (For the significance of variables

Algorithm NAlgorithm N (Natural two-way merge sort). Records R1,…,RN are sorted using two areas of memory, each of which is capable of holding N records. For convenience, we shall say that the reco

Algorithm HAlgorithm H (Heapsort). Records R1,… ,RN are rearranged in place; after sorting is complete, their keys will be in order, K1<=…<=KN. First we rearrange the file so that it forms a heap,

Algorithm QAlgorithm Q (Quicksort). Records R1,...,RNR_1,... ,R_N are rearranged in place; after sorting is complete their keys will be in order, K1<=...<=KNK_1<=...<=K_N. An auxiliary stack with a

Heapsort-1:堆排序-1Animation A run of the heapsort algorithm sorting an array of randomly permuted values. In the first stage of the algorithm the array elements are reordered to satisfy the heap propert

Straight selection sort:直接选择排序Animation Selection sort animation Selection sort animation. Red is current min. Yellow is sorted list. Blue is current item.Complexity Class Sorting algorithm Data

Java program/** * Created with IntelliJ IDEA. * User: 1O1O * Date: 11/30/13 * Time: 10:01 PM * :)~ * Radix sort:Sorting by Exchanging:Internal Sorting */public class Main { public static voi

Quicksort-1:快速排序-1Animation nimated visualization of the quicksort algorithm. The horizontal lines are pivot values. Full example of quicksort on a random set of numbers. The shaded element is the pi

Algorithm MAlgorithm M (Merge exchange). Records R1,...,RNR_1,..., R_N are rearranged in place; after sorting is complete their keys will be in order, K1<=...<=KNK_1<=...<=K_N. We assume that N>=2N

Cocktail-shaker sortAnimationComplexity Class Sorting algorithm Data structure Array Worst case performance O(n2)O(n^2) Best case performance O(n)O(n) Average case performance O(n2)O

Bubble sort:冒泡排序Animation Static visualization of bubble sort An example of bubble sort. Starting from the beginning of the list, compare every adjacent pair, swap their position if they are not in t

Data tableJava programIn this program, R1,…,RN were simplified to K1,…,KN./** * Created with IntelliJ IDEA. * User: 1O1O * Date: 11/25/13 * Time: 10:01 PM * :)~ * Multiple list insertion:Sorting

Algorithm LAlgorithm L (List insertion). Records R1,...,RNR_1,..., R_N are assumed to contain keys K1,...,KNK_1,..., K_N, together with link fields L1,...,LNL_1,..., L_N capable of holding the number

Shellsort:希尔排序Animation Shellsort with gaps 23, 10, 4, 1 in action. The step-by-step process of replacing pairs of items during the shell sorting algorithm.Complexity Class Sorting algorithm Dat

Data tableJava program/** * Created with IntelliJ IDEA. * User: 1O1O * Date: 11/22/13 * Time: 10:01 PM * :)~ * Two-way insertion:Sorting by Insertion:Internal Sorting */public class Main { p

Java program/** * Created with IntelliJ IDEA. * User: 1O1O * Date: 11/21/13 * Time: 10:01 PM * :)~ * Binary insertion:Sorting by Insertion:Internal Sorting */public class Main { public static

Straight insertion sort:直接插入排序Animation Graphical illustration of insertion sort A graphical example of insertion sort. Animation of the insertion sort sorting a 30 element array.Complexity Class

Algorithm DAlgorithm D (Distribution counting). Assuming that all keys are integers in the range u<=Kj<=vu<=K_j<=v for 1<j<N1< j < N, this algorithm sorts the records R1,...,RNR_1,..., R_N by making

Algorithm CAlgorithm C (Comparison counting). This algorithm sorts R1,...,RNR_1 ,..., R_N on the keys K1,...,KNK_1,...,K_N by maintaining an auxiliary table COUNT[1],...,COUNT[N]COUNT[1],..., COUNT[N]

Odd-even sortAnimation Example of odd-even transposition sort sorting a list of random numbersComplexity Class Sorting algorithm Data structure Array Worst case performance O(n2)O(n^2) Be

Comb sortAnimation Visualisation of Comb sortComplexity Class Sorting algorithm Data structure Array Worst case performance O(n2)O(n^2) Best case performance O(n)O(n) Average case per

Gnome sortAnimation Visualisation of Gnome sortComplexity Class Sorting algorithm Data structure Array Worst case performance O(n2)O(n^2) Best case performance Ω(n)\Omega(n) Average c

Java program/** * User: >_< * Date: 11/12/15 * Time: 10:51 AM */public class OptimizedGnomeSort { public static void optimized_gnome_sort(int[] input){ int pos = 1; int last = 0;

Stooge sortAnimation Visualization of Stooge sort.Complexity Class Sorting algorithm Data structure Array Worst case performance O(nlog3/log1.5)O(n^{\log3 / \log1.5}) Worst case space com

BogosortAnimation A possible, but improbable, single shuffle execution of the bogo sort algorithm.Complexity Class Sorting algorithm Data structure Array Worst case performance Unbounded

Java programimport java.util.Random;/** * User: >_< * Date: 11/12/15 * Time: 1:04 PM */public class BozoSort { public static void random_swap(int[] input, int size){ Random random = new R