Shell Sort Algorithm Explained and Implemented with Examples in Java | Sorting Algorithms | Geekific
HTML-код
- Опубликовано: 30 июл 2024
- Support us on Patreon: / geekific
Discord Community: / discord
GitHub Repository: github.com/geekific-official/
In this video, as part of our sorting algorithms series and as a continuity to the Insertion Sort video we previously uploaded, we explain and implement in two different ways the Shell Sort algorithm.
Timestamps:
00:00 Introduction
00:55 Real-Life Approach
03:12 Sorting an array using Shell Sort!
04:57 Shell Sort Implementation
08:48 Putting our Code to the Test
09:48 Shell Sort, Streams and Recursion
11:18 Thanks for Watching!
If you found this video helpful, check other Geekific uploads:
- Insertion Sort - Explained and Implemented: • Insertion Sort Explain...
- Java's Stream API Explained with Examples: • Java Stream API Explai...
- MergeSort Explained and Implemented in Java: • Merge Sort Algorithm E...
- New Features in Java 17: • New Features in Java 1...
- Sorting Algorithms Complexity: • Sorting Algorithms Tim...
- Generics and Wildcards in Java Made Simple: • Generics and Wildcards...
- Heap Space vs. Stack Memory in Java: • Heap Space vs. Stack M...
- Graphs, The Fundamentals: • Introduction to Graphs...
- Introduction to Unit-Testing with TDD: • Introduction to Unit-T...
- Dual-Pivot Quicksort Explained and Implemented in Java: • Dual-Pivot Quicksort E...
- TimSort Explained and Implemented in Java: • TimSort Explained and ...
#Geekific #SortingAlgorithms #ShellSort #Java
literally the best video I have ever seen so far regarding the shell sort algorithm , really you made it a lot easier
Glad to hear/read that! And happy it helped
The little details, the complete explanation, the different implementations, this tutorial is perfect!
literally the best video on shell sort.
My professor is making us learn shell sort and he didn't explain it well at all, but this video made me understand it perfectly! You are a life saver!
That's why we're here! Glad it helped :)
The same is happening to me😆
10:18
Shouldn't we swap index and index - gap?
If no why index -1?
I was wondering why this channel is not popular enough, just checked and it was created in 2021.
I don't know your age. You started late in RUclips. But better late than never. Excellent upto the point.
Masterpiece.
Thanks a lot for the support man!
Awesome explanation. I copied and adjusted my own insertion sort implementation to shellsort and went from 41 swaps to just 12 with the same data.
Nice work! Glad I could help :)
The best video I have watched explaining Shell Sort, Wish you the best to have more subscribers.. gonna watch more of your videos
Thank you so much :)
very clear explanation. Really helpful. Thanks for creating this video. Great work.
You are welcome! Glad you liked it :)
best explanation on youtube, thanks
Wow, thanks!
Very very good explanation in the video!
Glad it was helpful! Thanks :)
These videos are invaluable; thank you for sharing! Would you consider creating a video about Timsort?
Thanks a lot :) Sure thing! It is on my to-do list. Stay Tuned!
helped me a lot thankss
Glad to read that!
Please create a video for Timsort and Cubesort.
Will do! Stay Tuned :)
Is this a good algorithm for elements around half a million?
Depends on the dataset, if it is almost sorted it will be similar in performance to classic insertion sort.
A very clear explanation.But the recursion part is somewhat confusing😶
Glad you liked it!