Shell Sort Algorithm | Shell Sort In Data Structure | Learn Sorting Algorithms |

1. Shell Sort

2. Agenda Shell Sort

3. Agenda Shell Sort

4. Shell Sort Click here to watch the video

5. Agenda Shell Sort Introduction

6. Agenda Shell Sort Introduction Algorithm

7. Agenda Shell Sort Introduction Algorithm Implementation

8. Agenda Shell Sort Introduction Conclusion Algorithm Implementation

9. Introduction

10. Introduction Shell sort is a highly efficient sorting algorithm and is based on insertion sort algorithm This algorithm avoids large shifts as in case of insertion sort, if the smaller value is to the far right and has to be moved to the far left.

11. Introduction Shell sort is a highly efficient sorting algorithm and is based on insertion sort algorithm This algorithm avoids large shifts as in case of insertion sort, if the smaller value is to the far right and has to be moved to the far left.

12. Introduction Shell sort is a highly efficient sorting algorithm and is based on insertion sort algorithm This algorithm avoids large shifts as in case of insertion sort, if the smaller value is to the far right and has to be moved to the far left.

13. Algorithm

14. Algorithm 8 4 6 2 5 10 Initialize the value of interval h

15. Algorithm 6 4 Divide the list into smaller sub-list of equal interval h 2 8 10 5

16. Algorithm 4 6 Sort these sub-lists using insertion sort 2 8 10 5

17. Algorithm 6 5 8 Then we will decrease h by 1 and repeat until complete list is sorted 2 10 4

18. Implementation

19. Conclusion

20. Conclusion Shell sort has higher cache miss ratio than quicksort. Shell sort is helpful when small elements are to the farther right. Shell sort utilizes insertion sort algorithm. Shell sort requires less swaps than insertion sort.