×
Home Discussions Write at Opengenus IQ
×
  • DSA Cheatsheet
  • HOME
  • Track your progress
  • Deep Learning (FREE)
  • Join our Internship 🎓
  • RANDOM
  • One Liner

quick sort

A collection of 8 posts

Algorithms

Quick Sort using Queue

In this OpenGenus, we have explored how to implement Quick Sort using Queue data structure. Usually, stack data structure is used with Quick Sort.

Kazi Priom Kazi Priom
quick sort

Quick Sort in Python using OOP

In this article at OpenGenus, we will explore the implementation of Quick Sort in Python using the principles of Object-Oriented Programming (OOP). By utilizing classes and objects, we'll implement the Quick Sort algorithm to efficiently sort arrays or lists of elements.

MATHANKUMAR V
C++

QuickSort using template in C++

In this article, we have designed and implemented Quick Sort algorithm in C++ Programming Language to use the concept of template to make Quick Sort generic/ independent of input datatype.

Gabriel
quick sort

Quick sort using stack

In this article, we will study about Quick sort algorithm along with it's implementation using stack in C++. Before getting started with Quick sort using Stack we should know about stack data structure.

Shruti Singh
Sorting Algorithms

Different Pivot selection in Quick Sort

In this article, we have explored Different Pivot selection techniques in Quick Sort such as Median of Medians, Mode, First Element and much more along with Time Complexity of all methods.

Shlok Singh
Algorithms

Quick Sort with two pivots (Dual-Pivot)

Quick Sort is a Sorting Algorithm that takes a divide-and-conquer approach. We will be looking at how to do this while selecting two pivots points instead of one.

Shubhankar Maurya Shubhankar Maurya
Algorithms

3 Way Partitioning Quick Sort

In this article, we have explored 3 Way Partitioning Quick Sort in depth. This is relatively faster than 2 way Quick Sort (Normal version) in practical applications.

Aravind Mohandas Aravind Mohandas
Sorting Algorithms

Quick Sort

Algorithm Complexity Implementations Optimizations Applications Discussions Reading time: 20 minutes | Coding time: 10 minutes Quicksort algorithm is a comparison based sort algorithm based on Divide and Conquer strategy that is it aims to

Alexa Ryder Alexa Ryder
OpenGenus IQ © 2025 All rights reserved â„¢
Contact - Email: team@opengenus.org
Primary Address: JR Shinjuku Miraina Tower, Tokyo, Shinjuku 160-0022, JP
Office #2: Commercial Complex D4, Delhi, Delhi 110017, IN
Top Posts LinkedIn Twitter
Android App
Apply for Internship