C++ Program to Implement Shell Sort Algorithm (Full Code) | Part - 2 | Sorting Algorithms

  Рет қаралды 12,423

Simple Snippets

Simple Snippets

Күн бұрын

Пікірлер: 23
@harshbansal6484
@harshbansal6484 Жыл бұрын
Never watched a video which have such in-dept analysis and full visualisation of the algorithm like here. Really appreciable Sir..
@CricketLover-ok2pv
@CricketLover-ok2pv 4 жыл бұрын
Searching And Sorting One of the most frequently asked topics learned with an ease.Thank U For Everything Sir 💯 Just Mind Blowing 🙏
@SimpleSnippets
@SimpleSnippets 4 жыл бұрын
So nice of you. Please support me by sharing the videos and our channel with your friends too. Thats the biggest help and support you can provide 😇
@alexandrekouakou8385
@alexandrekouakou8385 10 ай бұрын
Wow you are just amazing. I just now want to learn more from you. Thank you so much!
@masumali8356
@masumali8356 2 жыл бұрын
You are the best....masum
@jamesnash9675
@jamesnash9675 2 жыл бұрын
you r the best teacher
@karanthakkar4423
@karanthakkar4423 4 жыл бұрын
Please publish book with same. Your explanation is in depth. I felt good to know when I checked your linkedin profile we both have studied in I.Y college ✌️
@SimpleSnippets
@SimpleSnippets 4 жыл бұрын
Thats great to know Karan, although I hardly ever attended IY 😂 Would love to hear more from you :-)
@raghavgupta3168
@raghavgupta3168 4 жыл бұрын
Just Awesome👌👍
@SimpleSnippets
@SimpleSnippets 4 жыл бұрын
Thank you buddy. Glad to hear this from you. please do share this videos and our channel with your friends too bro, thats the biggest help and support 😇
@amalprakash5632
@amalprakash5632 3 жыл бұрын
Hi Tanmay, Nice course I love it. But I am kinda confused here, Isn't the one in the video Shell Sort implemented using Insertion sort? Because we are using the temp variable to move around the hole created in the array, like in Insertion sort. Isn't this the code for Shell Sort implemented using bubble sort? forgive me if it sounds stupid, because I am pretty new to this. void ShellSort(int array[], int size) { int gap = size/2; for (gap; gap>0; gap /= 2) { for(int j = gap ; j=0 and array[i+gap]
@torggas
@torggas 3 жыл бұрын
Awesome sir, things become easier with your perfect videos, much love from South Sudan.
@adarshnaik9483
@adarshnaik9483 3 жыл бұрын
How to show iterations?
@sravankumar5017
@sravankumar5017 Жыл бұрын
I think we have to use i=j instead of i=0
@nivyaraj559
@nivyaraj559 4 жыл бұрын
U r too brilliant 👍👍👍
@SimpleSnippets
@SimpleSnippets 4 жыл бұрын
Thank you Nivya 😇 please do share the video with your friends too ✌️
@nivyaraj559
@nivyaraj559 4 жыл бұрын
@@SimpleSnippets Done 👍👍👍
@anupapatil1594
@anupapatil1594 3 жыл бұрын
Sir , please upload vedio based on Java program also
@ishitamittal1546
@ishitamittal1546 3 жыл бұрын
Sir why did we use temp variable.. everytime j changes, arr[j] and temp both change... so why not use arr[j] only.. Please help sir
@sravankumar5017
@sravankumar5017 Жыл бұрын
If we don't use temp variable again same swapped value will get stored in updated "i" Value, so if u execute the program like that u will get repeated values in output array. So temp variable is mainly used here for proper swapping
@abhinavkumar5000
@abhinavkumar5000 4 жыл бұрын
22 views in 22 minutes.......
@SimpleSnippets
@SimpleSnippets 4 жыл бұрын
Thats good to know ✌
The CUTEST flower girl on YouTube (2019-2024)
00:10
Hungry FAM
Рет қаралды 53 МЛН
Sorts 5 Shell Sort
6:53
RobEdwards
Рет қаралды 189 М.
Bubble Sort | C++ Example
13:20
Portfolio Courses
Рет қаралды 25 М.
WHY IS THE HEAP SO SLOW?
17:53
Core Dumped
Рет қаралды 224 М.
Learn Quick Sort in 13 minutes ⚡
13:49
Bro Code
Рет қаралды 338 М.
Naming Things in Code
7:25
CodeAesthetic
Рет қаралды 2,1 МЛН
Premature Optimization
12:39
CodeAesthetic
Рет қаралды 807 М.