Setup:

• Let Gap Size (GS) be initial number of elements

Repeat while GS >= 1:

• Update GS: GS = floor(GS / 2)

• Select indices by skipping GS elements

• Insert Sort elements at selected indices

Setup:

• Pick Divisor Factor (DF) as 1.3

• Let Gap Size (GS) be initial number of elements

Repeat while GS >= 1:

• Update GS: GS = floor(GS / DF)

• Select indices by skipping GS elements

• Bubble Sort elements at selected indices

• Create initial max heap

• Repeat until heap runs out of nodes:

  • Swap the last node with max node

  • Remove max node and push onto stack

  • Heapify root node

In Quick Sort, we will select a pivot using the Median of three approach. And swap numbers which are less than pivot (LTP) and greater than or equal to pivot (GTP)

Tim Sort is a hybrid approach that combines Binary Insertion Sort and Merge Sort.

And it's strength is that it takes advantage of any naturally occurring ordering in the data.

From a high level, Radix Sort works by sorting integers from the least significant digit to the most significant digit.

Given array has more than one item:

• half array

• merge-sort first half

• merge-sort second half

• merge first half and second half

1. Bubble up the largest number in the unsorted space

   • adjacent numbers are swapped when left number is greater than right number

2. Reduce the unsorted space

3. Repeat 1.and 2. until the unsorted space is empty

1. Left swap repeatedly first number in unsorted space until

   • the first number is greater than number on its left

   • the first number has no left number

2. Reduce the unsorted space

3. Repeat (1) and (2) until the unsorted space is empty

In Selection Sort, we will repeatedly swap the first and min elements in unsorted space. And Each time a swap occurs, the unsorted space is decreased.