vampirepapi.hashnode.devQuick Sort Algorithm: Step-by-Step Guide for Efficient SortingQuick 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 read
vampirepapi.hashnode.dev1. Two Sum-Arrays & HashingSolving 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 read
vampirepapi.hashnode.devUnderstanding Bubble Sort: Simple Sorting MethodBubble 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 read
vampirepapi.hashnode.devMerge sort | RecursionMerge 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 read
vampirepapi.hashnode.devNeovim, but it鈥檚 in WindowsI 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 read