×
Home Discussions Write at Opengenus IQ
×
  • About
  • Track your progress
  • Deep Learning Projects
  • Python Projects
  • Join our Internship 🎓
  • RANDOM
  • 100+ Graph Algorithms
  • 100+ DP Problems
  • 50+ Linked List Problems
  • 50+ Array Problems
  • One Liner
  • 50+ Binary Tree problems
  • Home
  • Rust Projects

Sorting Algorithms

Sorting is an important operation as rearranging a data set optimally based on a given comparison strategy is a challenging task. The best approach depends on the characteristics of the data

C++

Parallel Radix Sort handling positive & negative numbers in C++

In this article, we have designed and implemented Parallel Radix Sort handling positive and negative numbers in C++ Programming Language.

Gabriel
trie

Lexicographic sorting using Trie

Lexicographic sorting is a way of sorting a set of strings based on their alphabetical order We can also say that the order in which those words appear in a dictionary.

Aswin Shailajan
Algorithms

Maximum Gap [Solved]

In this article, we are going to see the interesting solution to the problem - "Maximum Gap". This will involve the concept of Bucket Sort and Radix Sort.

Harshit Raj
cheatsheet

Cheatsheet for sorting algorithms

This is the complete cheatsheet for all the important sorting algorithms that comprises that will act as a summary of each concepts including time complexity, key weakness and strengths.

Harshit Raj
Sorting Algorithms

Modified Bubble Sort

Modified Bubble Sort or Short bubble sort is a variation of the standard bubble sort algorithm that improves the best-case time complexity from O(n^2) to O(n) by using a flag to check if the array is already sorted.

Anay Dongre
Algorithms

Height Checker Problem

In this article, we have solved the Height Checker Problem with two different approaches. This involve the concept of using Counting Sort efficiently.

Harshit Raj
Algorithms

H-index problem

Calculate the researcher's h-index from an array of integer citations, where citations[i] is the number of citations a researcher obtained for their ith work.

Harshit Raj
Time Complexity

Time Complexity to sort N strings

In this article, we have explored the Time Complexity to sort N strings when each string is of length M. This is an important Algorithmic questions which most get it wrong.

Ue Kiao, PhD Ue Kiao, PhD
Algorithms

Weighted Median Problem

Weighted Median is a measure of central tendency which is better than normal median. In this let us consider a weighted median value ‘wi’ when the elements are sorted such that the total weight of the elements to the left of wi is half of the total weight.

Anuj Dharme
Sorting Algorithms

Bubble sort vs Selection sort

Bubble sort and Selection sort are both comparison-based sorting algorithms which can be differentiated through the methods they use for sorting. But before going through the key differences between them, let's understand how both of these algorithms work.

Saumya Panda
Time Complexity

Time and Space Complexity of Merge Sort on Linked List

In this article, we will learn about the space and time complexity of the Merge sort algorithm on Linked List using Mathematical analysis of various cases.

Suraj Kumar Suraj Kumar
Algorithms

Merge Insertion Sort

Merge Insertion Sort is the combination of Merge sort and Insertion sort that minimizes the worst case time complexity for smaller value of n.

Uddeshya Raj
Time Complexity

Worst Case of Merge Sort

In this article, we have covered the scenario when Merge Sort performs worst, how to identify such worst case inputs and Time Complexity analysis of Worst Case of Merge Sort.

Uddeshya Raj
Algorithms

Worst Case of Quick Sort

In this article, we will discuss about the Worst Case Time Complexity about 'Quick-Sort' algorithm along with the complete time complexity analysis of the worst case.

Karan 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
Sorting Algorithms

Different Hybrid Sorting Algorithms

In this article, we will discuss about various Hybrid sorting algorithms such as Tim Sort Algorithm. Hybrid Sorting Algorithms tend to perform better than pure Sorting Algorithms and hence, are widely used in practice.

Harshul Nanda Harshul Nanda
Algorithms

Intro Sort

In this article, we will discuss about the Introspective or Intro sort algorithm which is an efficient Hybrid Sorting Algorithm making use of Quick Sort, Heap Sort and Insertion Sort.

Harshul Nanda Harshul Nanda
Time Complexity

Time and Space Complexity of Comb Sort

In this article, we will learn about Time Complexity and Space Complexity of Comb Sort algorithm, with the in-depth mathematical analysis of different cases. Comb Sort is also known as Dobosiewicz Sort.

Harshul Nanda Harshul Nanda
Time Complexity

Time and Space Complexity of Insertion Sort on Linked List

In this article, we have explored Time and Space Complexity analysis of Insertion Sort on Linked List.

Purvak Baliyan
Time Complexity

Time and Space Complexity of Stooge Sort

In this article, we will be discussing the time and space complexity of Stooge Sort covering various cases like Worst, Best and Average Case.

Mohd Ehtesham Uddin Qureshi Mohd Ehtesham Uddin Qureshi
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
Algorithms

Parallel Bubble Sort

In this article, we have explored how to implement Bubble Sort in parallel on multiple threads / cores. We have presented two approaches: one is slower than the sequential approach but the other approach is significantly faster than all other approaches for large input.

Akanksha Singh
Algorithms

Quick Sort on Linked List

In this article, we have explained how to implement Quick Sort on Linked List and if it is as efficient as Quick Sort on Array.

Mohd Ehtesham Uddin Qureshi Mohd Ehtesham Uddin Qureshi
Algorithms

Bubble Sort on Linked List

In this article, we have presented the approach to implement Bubble Sort on Singly Linked List and Doubly Linked List along with implementations in C and C++.

Shwet Shukla Shwet Shukla
OpenGenus IQ © 2023 All rights reserved â„¢ [email: team@opengenus.org]
Top Posts LinkedIn Twitter