Grokking Advanced Coding Patterns for Interviews
Ask Author
Back to course home

0% completed

Introduction to Linear Sorting Algorithms
Table of Contents

Contents are not accessible

Contents are not accessible

Contents are not accessible

Contents are not accessible

Contents are not accessible

Linear time sorting refers to a group of sorting algorithms that can sort data in O(n) time complexity, where n is the number of elements in the dataset. This is in contrast to comparison-based sorting algorithms like Quick Sort/Merge Sort, which have average time complexities of O(n log n). Linear time sorting algorithms achieve this efficiency by using techniques that do not rely on comparisons between elements.

Types of Linear Sorting Algorithms

  • Counting Sort
  • Radix Sort
  • Bucket Sort

.....

.....

.....

Like the course? Get enrolled and start learning!

Table of Contents

Contents are not accessible

Contents are not accessible

Contents are not accessible

Contents are not accessible

Contents are not accessible