---
title: "Nishant Kumar (@CosmicTechie) | Hashnode"
description: "Cosmic Enthusiast. Read the latest articles by Nishant Kumar on Hashnode."
url: "https://hashnode.com/@CosmicTechie"
---

@CosmicTechie

# Nishant Kumar

@CosmicTechie · India · Joined January 2022

Cosmic Enthusiast

[Website](https://cosmictechie.com/)

### [Coding Problem: Sober Walk](https://cosmictechie.hashnode.dev/coding-problem-sober-walk?utm_source=hashnode&utm_medium=feed)

Our 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 ...

1 min read · [cosmictechie.hashnode.dev](https://cosmictechie.hashnode.dev/coding-problem-sober-walk?utm_source=hashnode&utm_medium=feed)

[Feb 9, 2022](https://hashnode.com/posts/coding-problem-sober-walk/62033ac9b6c216065a35a6a7)

### [Heap Sort](https://cosmictechie.hashnode.dev/heap-sort?utm_source=hashnode&utm_medium=feed)

Heap 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...

2 min read · [cosmictechie.hashnode.dev](https://cosmictechie.hashnode.dev/heap-sort?utm_source=hashnode&utm_medium=feed)

[Feb 6, 2022](https://hashnode.com/posts/heap-sort/61ffe4134cde6d5e5ab0fe2a)

### [Quick Sort](https://cosmictechie.hashnode.dev/quick-sort?utm_source=hashnode&utm_medium=feed)

Quick 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...

2 min read · [cosmictechie.hashnode.dev](https://cosmictechie.hashnode.dev/quick-sort?utm_source=hashnode&utm_medium=feed)

[Feb 1, 2022](https://hashnode.com/posts/quick-sort/61f89d56dc17c30cdb112714)

### [Selection Sort](https://cosmictechie.hashnode.dev/selection-sort?utm_source=hashnode&utm_medium=feed)

Selection 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 ...

1 min read · [cosmictechie.hashnode.dev](https://cosmictechie.hashnode.dev/selection-sort?utm_source=hashnode&utm_medium=feed)

[Jan 24, 2022](https://hashnode.com/posts/selection-sort/61ee1af1c99aed184e725d64)

### [Insertion Sort](https://cosmictechie.hashnode.dev/insertion-sort?utm_source=hashnode&utm_medium=feed)

Insertion Sort is a simple sorting algorithm. It is like picking up an element from the list and inserting it to its rightful index as per intended order of the elements in the list. Initially, the first element is considered to be at its right place...

1 min read · [cosmictechie.hashnode.dev](https://cosmictechie.hashnode.dev/insertion-sort?utm_source=hashnode&utm_medium=feed)

[Jan 21, 2022](https://hashnode.com/posts/insertion-sort/61ead3e10b35507a93a04c3f)
