phjung1 Blog

「😅」

Comb Sort

Comb Sort Comb Sort is mainly an improvement over Bubble Sort. Bubble sort always compares adjacent values. So all inversions are removed one by one. Comb Sort improves on Bubble Sort by using gap...

1Posted by phjung1 on December 23, 2021

Vim notation

Vim notaiton Playing Chords Placeholders Showing Special Keys interacting with the Command Line

1Posted by phjung1 on December 22, 2021

ShellSort

ShellSort ShellSort is mainly a variation of Insertion Sort. In insertion sort, we move elements only one position ahead. When an element has to be moved far ahead, many movements are involved. Th...

1Posted by phjung1 on December 22, 2021

Bucket Sort

Bucket Sort Bucket sort is mainly useful when input is uniformly distributed over a range. For example, consider the following problem. Sort a large set of floating point numbers which are in ran...

1Posted by phjung1 on December 21, 2021

Counting Sort

Counting Sort Counting sort is a sorting technique based on keys between a specific range. It works by counting the number of objects having distinct key values (kind of hashing). Then doing some ...

1Posted by phjung1 on December 20, 2021

Radix Sort

Radix Sort The lower bound for Comparison based sorting algorithm (Merge Sort, Heap Sort, Quick-Sort .. etc) is Ω(nLogn), i.e., they cannot do better than nLogn. Counting sort is a linear time so...

1Posted by phjung1 on December 19, 2021

Set up GitHub push with SSH keys.md

SSH keypair setup for GitHub (or GitHub/GitLab/BitBucket, etc, etc) Create a repo. Make sure there is at least one file in it (even just the README.md) Generate a SSH key pair (private/public): 1...

1Posted by phjung1 on December 18, 2021

QuickSort

QuickSort Like Merge Sort, QuickSort is a Divide and Conquer algorithm. It picks an element as pivot and partitions the given array around the picked pivot. There are many different versions of qu...

1Posted by phjung1 on December 18, 2021

HeapSort

HeapSort Heap sort is a comparison-based sorting technique based on Binary Heap data structure. It is similar to selection sort where we first find the minimum element and place the minimum elemen...

1Posted by phjung1 on December 17, 2021

Merge Sort

Merge Sort Like QuickSort, Merge Sort is a Divide and Conquer algorithm. It divides the input array into two halves, calls itself for the two halves, and then merges the two sorted halves. The mer...

1Posted by phjung1 on December 16, 2021