NKNishant Kumarincosmictechie.hashnode.dev·Feb 9, 2022 · 1 min readCoding Problem: Sober WalkOur hoary culture had several great persons since time immemorial and king vikramaditya’s nava ratnas(nine gems) belongs to this ilk. They are named in the following shloka: Among these, Varahamihira was an astrologer of eminence and his book Brihat ...00
NKNishant Kumarincosmictechie.hashnode.dev·Feb 6, 2022 · 2 min readHeap SortHeap Sort is a sorting algorithm based on the heap data structure. A heap is a tree based data structure where the tree is a complete binary tree. A complete binary tree is a binary tree in which all levels are completely filled, except the last leve...00
NKNishant Kumarincosmictechie.hashnode.dev·Feb 1, 2022 · 2 min readQuick SortQuick Sort is an algorithm for sorting which is based on divide and conquer approach. An element is chosen as pivot and partitions the given list. The elements are swapped, based on comparison with pivot value, in order to obtain a sorted list. The p...00
NKNishant Kumarincosmictechie.hashnode.dev·Jan 27, 2022 · 2 min readMerge SortMerge Sort is a sorting algorithm which is based on divide and conquer approach. The list is divided into two halves until each sub list has a single element, and the sub lists are merged in a sorted manner that the sorted list is obtained. It is a v...00
NKNishant Kumarincosmictechie.hashnode.dev·Jan 24, 2022 · 1 min readSelection SortSelection sort is a sorting algorithm in which the list is considered into two parts, sorted part at left and unsorted part at right. It selects the smallest element from the unsorted list, in each iteration, and places that element at the beginning ...00
