 Conversely, some sorting algorithms can be derived by repeated application of a selection algorithm; quicksort and quickselect can be seen as the same pivoting move, differing only in whether one recurses on both sides (quicksort, divide and conquer) or one side (quickselect, decrease and conquer).A kind of opposite of a sorting algorithm is a shuffling algorithm.These are fundamentally different because they require a source of random numbers.