Gnome Sort Algorithm - Almost Insertion Sort

Published: 29 August 2021
on channel: Stephen Melvin

2,336

The gnome sort algorithm is a sorting algorithm that swaps adjacent elements if they're out of order, like bubble sort or cocktail sort, but instead of doing whole passes in one direction, it goes left if it swapped and right if it didn't. I'm gonna write the code for gnome sort and go through how it works step by step. I'll also show you what happens in different cases, like if it's already sorted, almost sorted or reversed.

Sorting Algorithms playlist: • Sorting Algorithms

00:00 Overview
00:35 Writing the gnome sort code
02:55 Explaining roughly
04:40 Adding a small optimisation
05:54 Explaining step by step
10:30 Showing the already sorted case
11:32 Showing the large shuffled case
12:45 Showing the reverse case
13:55 Showing the almost sorted case
14:16 Showing holding on swaps

On this page of the site you can watch the video online Gnome Sort Algorithm - Almost Insertion Sort with a duration of hours minute second in good quality, which was uploaded by the user Stephen Melvin 29 August 2021, share the link with friends and acquaintances, this video has already been watched 2,336 times on youtube and it was liked by 92 viewers. Enjoy your viewing!

1,019,015

21K