Cycle Sort Algorithm - Sorting with Minimal Writes

Published: 21 August 2021
on channel: Stephen Melvin

11,722

446

The cycle sort algorithm is a sorting algorithm that uses the fact that any permutation is a product of disjoint cycles to sort an array with the minimum number of writes. I'm gonna use an example with cars to explain the idea. Then I'll write the code and explain how it works. I'll also show what happens in different cases, like if the input's already sorted, almost sorted or reversed.

Sorting Algorithms playlist: • Sorting Algorithms

00:00 Overview
00:36 Explaining with cars
05:12 Writing the cycle sort code
10:12 Stepping through the algorithm
11:24 Fixing two elements the same
13:18 Minimising the number of writes
15:36 Showing the already sorted case
16:17 Showing the reverse order case
17:49 Showing the large shuffled case
19:02 Showing the almost sorted case

On this page of the site you can watch the video online Cycle Sort Algorithm - Sorting with Minimal Writes with a duration of hours minute second in good quality, which was uploaded by the user Stephen Melvin 21 August 2021, share the link with friends and acquaintances, this video has already been watched 11,722 times on youtube and it was liked by 446 viewers. Enjoy your viewing!

1,019,015

21K