Eniola Bakareeniola-bakare.hashnode.dev·Dec 5, 2024A Working Understanding of AlgorithmsAn algorithm is a finite sequence of well-defined instructions, typically used to solve a class of specific problems or to perform a computation. - Wikipedia An algorithm refers to a set of step-by-step instructions to be followed to achieve a partic...13 likes·30 readsA Working Understanding of Data Structures and Algorithms (DSA)algorithms
Akash De Alwiszencode002.hashnode.dev·Nov 28, 2024Sorting Algorithms.Sorting algorithms are used to arrange data in a specific order, typically ascending or descending. There are four basic sorting algorithms Bubble Sort, Selection Sort, Merge Sort, and Quick Sort 1. Bubble Sort Bubble Sort is one of the simplest sort...algorithms
Aaqib Bashir Mirquick-sort.hashnode.dev·Nov 23, 2024Understanding Quick Sort with C ImplementationSorting algorithms play a crucial role in computer science, helping us organize and manipulate data efficiently. One such powerful and widely used sorting technique is Quick Sort. In this blog, we’ll explore the Quick Sort algorithm, understand its m...Quick Sort
Keerthi Ravilla Subramanyamkeerthiravillasubramanyam.hashnode.dev·Oct 20, 2024Quick Sort Simplified: The Ultimate Beginner's Guide to Fast SortingIn our previous articles, we've explored sorting algorithms like Bubble Sort, Selection Sort, Insertion Sort, and Merge Sort. Now, let's dive into Quick Sort, another popular and efficient sorting algorithm widely used in practice. What is Quick Sort...Data structures courseQuick Sort
gayatri kumargeekee.hashnode.dev·Oct 14, 2024The Shark's PrecisionHow Sharks Teach Us to Sort Efficiently with Quick Sort Imagine a shark swimming swiftly through the ocean, making quick, precise decisions to capture its prey. This kind of speed and accuracy is reflected in the way Quick Sort works. Instead of slow...51 likesData Structures and AlgorithmsQuick Sort
Teja Illaakadurga.hashnode.dev·Oct 2, 2024Quick Sort Algorithm :Quick sort Algorithm : Time Complexity : O(n*log(n)) Space Complexity : O(1) Not a stable algorithm, Relative ordering of the elements is not guaranteed. import java.util.*; public class Main { public static void main(String[] args) { int[...Quick Sort
Jyotiprakash Mishrablog.jyotiprakash.org·Sep 26, 2024Introduction to SortingIn sorting algorithms, the primary goal is to arrange elements in a certain order, usually numerical or lexicographical. Sorting is a fundamental operation in computer science, with applications in database indexing, searching algorithms, and even ha...4 likes·1.6K readssorting
Musab Rayantechblogsbymusab.hashnode.dev·Sep 6, 2024Tackling Real-World Problems with Divide and Conquer: An Interactive GuideHave you ever wondered how to solve large-scale problems by breaking them down into smaller, more manageable pieces? That’s what Divide and Conquer is all about! In this blog, you’ll not only learn how Divide and Conquer works, but you’ll also apply ...divide and conquer
Saurav Maheshwarixauravww.hashnode.dev·Sep 5, 2024Top Techniques to Identify the K-th Largest ElementGiven an integer array nums and an integer k, return the k-th largest element in the array. Note that it is the k-th largest element in the sorted order, not the k-th distinct element. Example 1: Input: nums = [3,2,1,5,6,4], k = 2 Output: 5 Example ...Data Structures and AlgorithmsDSA
SANTOSH SINGHsantoshsingh.hashnode.dev·Sep 2, 2024Mastering Divide and Conquer Algorithms with JavaIntroduction Divide and conquer is a powerful algorithmic paradigm that forms the backbone of many efficient algorithms. By breaking a problem into smaller subproblems, solving them independently, and then combining their solutions, divide and conque...Problem Solvers' JournalDSAwithSantosh
