Similar Topics

Web Technologies32.1K+ articles

DSA20.5K+ articles

Arrays4.2K+ articles

Sorting1.1K+ articles

Searching1.0K+ articles

Linked List666+ articles

doubly linked list130+ articles

Merge Sort109+ articles

Linked-List-Sorting63+ articles

HSBC52+ articles

Quick Sort

77 posts

QuickSort Based Practice Problems

Last Updated: 23 July 2025

Problems based on Partitioning AlgorithmSorting an Array of Two Types.Stable Binary SortingStable Binary Sorting with O(1) SpaceThree Way Partitioning Around a RangeThree ...read more

Divide and Conquer

Stable Binary Sort

Last Updated: 23 July 2025

Given an array arr[] of integers, the task is to partition the array based on even and odd elements. The partition has to be stable, meaning the relative ordering of all e...read more

Hoare's Partition Algorithm

Last Updated: 26 May 2026

Given an array arr[], the task is to partition the array by assuming first element as pivot element. The partition of an array must satisfy the following two conditions:El...read more

article_image

School Learning

Lomuto Partition Algorithm

Last Updated: 19 March 2026

Given an array arr[], partition the array by assuming last element as pivot element. The partition of an array must satisfy the following two conditions:Elements smaller t...read more

article_image

Naive Partition Algorithm

Last Updated: 12 November 2025

Given an array arr[], the task is to partition the array by assuming last element as pivot element. The partition of an array must satisfy the following two conditions:Ele...read more

Kth Largest Element in an Array

Last Updated: 29 October 2025

Given an integer array arr[] of size n elements and a positive integer K, the task is to return the kth largest element in the given array (not the Kth distinct element).E...read more

Quick Select in Python

Last Updated: 23 July 2025

Quick Select is an efficient algorithm for finding the k-th smallest (or largest) element in an unordered list. It is a variation of the QuickSort algorithm and works by r...read more

qsort() Function in C

Last Updated: 23 July 2025

Theqsort()in C is alibrary function used to sort an array of items in ascending order or descending order. It stands for "quick sort," as it implements the quicksort algor...read more

C Library Functions

Bucket Sort vs Quick Sort

Last Updated: 23 July 2025

Bucket Sort and Quick Sort are two different sorting algorithms, each with its own characteristics, advantages, and disadvantages. In this article, we will provide a detai...read more

Top Interview Questions and Answers on Quick Sort

Last Updated: 23 July 2025

Quick Sort is a popular sorting algorithm used in computer science. In our article "Top Interview Questions and Answers on Quick Sort", we present a collection of essentia...read more

article_image

interview-preparation

placement preparation

Interview-Questions

Quick Sort in C

Last Updated: 11 June 2026

Quick Sort is a sorting algorithm that arranges elements by repeatedly selecting a pivot and partitioning the array into smaller sections. These sections are then sorted r...read more

article_image

C Misc Programs

Geeks Premier League 2023

Searching and Sorting Algorithm Notes for GATE Exam [2024]

Last Updated: 23 July 2025

As you gear up for the GATE Exam 2024, it's time to dive into the world of searching and sorting algorithms. Think of these algorithms as the super-smart tools that help c...read more

article_image

Algorithms-BubbleSort

How do you avoid a worst case algorithm for a quick sort?

Last Updated: 20 November 2023

QuickSort is a popular and efficient sorting algorithm that relies on a divide-and-conquer strategy to sort a list of elements. It is widely used in various computer scien...read more

Which Sorting Algorithm is Best and Why?

Last Updated: 11 August 2025

Sorting is one of the most fundamental operations in computer science. Choosing the best sorting algorithm depends on data characteristics, performance requirements, and c...read more

Geeks Premier League 2023

Time and Space Complexity Analysis of Quick Sort

Last Updated: 23 July 2025

The time complexity of Quick Sort is O(n log n) on average case, but can become O(n^2) in the worst-case. The space complexity of Quick Sort in the best case is O(log n), ...read more

article_image

Complexity-analysis

1 2 3 4 5 6