AlgoDaily - Sorting Interview Questions

Back to all AlgoDaily courses

Sorting Interview Questions

After understanding linear data structures and practicing on some problems, we'll now turn to one of the most important concepts in algorithms: sorting.

We'll cover the fundamentals and go through a collection of important basic sorting algorithms to know.

Section Menu

How do I use this section?

1. LESSON

A Sorting Algorithms Cheat Sheet

Today, we're diving into the fascinating world of sorting algorithms. A sorting algorithm is like a recipe for arranging a collection of elements (think Arrays, Hashes, and more) in a specific order. Two Families of Sorting Algorithms When it comes to sorting algorithms, they generally fall into one of two...

47 minutes Mark Completed

2. LESSON

No Comparison: Counting Sort and Radix Sort

This tutorial is about two awesome, non-comparison-based sorting algorithms. While many sorting algorithms require a comparator function that compares two values at a time, these two and their family of non-comparison methods rely on other techniques instead. We'll cover counting sort and radix sort, which are both very efficient. `Bu...

36 minutes Mark Completed

3. LESSON

Getting to Know the K-Way Merge Pattern

Exploring the K-Way Merge Algorithm: Merging Multiple Sorted Lists Imagine you're in the market for a new car and you've gathered price quotes from various dealerships. Each dealership provides you with a list of car prices, sorted from lowest to highest. Wouldn't it be convenient to have a single list, consolidating all these prices in sorted...

30 minutes Mark Completed

4. CHALLENGE

Sorted Two Sum

The setup is the same as Two Sum-- you're given an array of numbers, and a "goal" number. Write a method to return an array of the indexes of the two elements in the array that sum up to the goal. If there are no such elements, return an empty array. The caveat here is that the numbers are guaranteed to...

Difficulty: 5/10 Mark Completed

5. CHALLENGE

How Out of Order

This was submitted by user Hackleman. Determine how "out of order" a list is by writing a function that returns the number of inversions in that list. Two elements of a list L, L[i] and L[j], form an inversion if L[i] j. <img src="https://storage.googleapis.com/algodailyrandomassets/curriculum/me...

Difficulty: 5/10 Mark Completed