Different types of Shoring Algorithms with Animation
- 1. Welcome to our Presentation on Different types Sorting Algorithms with Animation
- 2. Bubble Sort Bubble sort is a simple sorting algorithm. This sorting algorithm is comparison-based algorithm in which each pair of adjacent elements is compared and the elements are swapped if they are not in order. This algorithm is not suitable for large data sets as its average and worst case complexity are of Ο(n2) where n is the number of items.
- 3. Process of Bubble Sort
- 4. Insertion Sort This is an in-place comparison-based sorting algorithm. Here, a sub-list is maintained which is always sorted. For example, the lower part of an array is maintained to be sorted. An element which is to be inserted in this sorted sub-list, has to find its appropriate place and then it has to be inserted there. Hence the name, insertion sort. This algorithm is not suitable for large data sets as its average and worst case complexity are of Ο(n2), where n is the number of items.
- 5. Process of Insertion Sort
- 6. Selection Sort Selection sort is a simple sorting algorithm. This sorting algorithm is an in- place comparison-based algorithm in which the list is divided into two parts, the sorted part at the left end and the unsorted part at the right end. Initially, the sorted part is empty and the unsorted part is the entire list. This algorithm is not suitable for large data sets as its average and worst case complexities are of Ο(n2), where n is the number of items.
- 7. Process of Selection Sort
- 8. Merge Sort Merge sort is a sorting technique based on divide and conquer technique. Merge sort first divides the array into equal halves and then combines them in a sorted manner. With worst-case time complexity being Ο(n log n), it is one of the most respected algorithms.
- 9. Process of Merge Sort
- 10. Quick sort Quick sort is a highly efficient sorting algorithm and is based on partitioning of array of data into smaller arrays. A large array is partitioned into two arrays one of which holds values smaller than the specified value, say pivot, based on which the partition is made and another array holds values greater than the pivot value. This algorithm is quite efficient for large-sized data sets as its average and worst case complexity are of Ο(n log n), where n is the number of items.
- 11. Process of Quick Sort
- 14. Zakaria Hossain