Shubham Sourabh (@vampirepapi)

Quick Sort Algorithm: Step-by-Step Guide for Efficient Sorting

Quick Sort Quick sort is a sorting algorithm that uses divide and conquer approach. It is similar to merge sort, but it has a time complexity of O(n log n). Quick Sort Algorithm 🔍 Purpose: Sort data structures in ascending order 🔄 Minor tweaks: Ad...

Sep 1, 2024 · 3 min readvampirepapi.hashnode.dev

1. Two Sum-Arrays & Hashing

Solving the Two Sum Problem: Three Approaches in Java The Two Sum problem is a classic algorithmic challenge that appears frequently in coding interviews and competitive programming. The problem statement is simple: given an array of integers and a t...

Aug 7, 2024 · 3 min readvampirepapi.hashnode.dev

Understanding Bubble Sort: Simple Sorting Method

Bubble sort achieves sorting by continuously comparing and swapping adjacent elements. This process resembles bubbles rising from the bottom to the top, hence the name bubble sort. As shown in the figure below, the bubbling process can be simulated u...

Aug 6, 2024 · 3 min readvampirepapi.hashnode.dev

Merge sort | Recursion

Merge sort is a sorting algorithm based on the divide-and-conquer strategy, involving the "divide" and "merge" phases shown in the figure below. Divide phase: Recursively split the array from the midpoint, transforming the sorting problem of a long ...

Aug 4, 2024 · 3 min readvampirepapi.hashnode.dev

Neovim, but it’s in Windows

I have had always been fan of neovim, but i have always used it in linux, but now i want to use this on Windows. Here i will document how you can install and use neovim on Windows. First install neovim from neovim on windows You can use Winget or Ch...

Jul 26, 2024 · 2 min readvampirepapi.hashnode.dev

Shubham Sourabh

About

Available for

Shubham Sourabh's blogs

Quick Sort Algorithm: Step-by-Step Guide for Efficient Sorting

1. Two Sum-Arrays & Hashing

Understanding Bubble Sort: Simple Sorting Method

Merge sort | Recursion

Neovim, but it’s in Windows

Shubham Sourabh

About

Available for

Shubham Sourabh's blogs

Quick Sort Algorithm: Step-by-Step Guide for Efficient Sorting

1. Two Sum-Arrays & Hashing

Understanding Bubble Sort: Simple Sorting Method

Merge sort | Recursion

Neovim, but it’s in Windows

Shubham Sourabh

About

Available for

Shubham Sourabh's blogs

Quick Sort Algorithm: Step-by-Step Guide for Efficient Sorting

1. Two Sum-Arrays & Hashing

Understanding Bubble Sort: Simple Sorting Method

Merge sort | Recursion

Neovim, but it’s in Windows

Search Hashnode

Shubham Sourabh

About

Available for

Shubham Sourabh's blogs

Quick Sort Algorithm: Step-by-Step Guide for Efficient Sorting

1. Two Sum-Arrays & Hashing

Understanding Bubble Sort: Simple Sorting Method

Merge sort | Recursion

Neovim, but it’s in Windows