Scribd
Upload
39 views

SN Sorting Algorithms Description: Bubble Sort

This document describes 9 different sorting algorithms: Bubble Sort, Bucket Sort, Comb Sort, Counting Sort, Heap Sort, Insertion Sort, Merge Sort, Quick Sort, and Radix Sort. It provides a brief 1-2 sentence description of each algorithm, including how they work and their time complexities.

Uploaded by

hari om
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
39 views

SN Sorting Algorithms Description: Bubble Sort

This document describes 9 different sorting algorithms: Bubble Sort, Bucket Sort, Comb Sort, Counting Sort, Heap Sort, Insertion Sort, Merge Sort, Quick Sort, and Radix Sort. It provides a brief 1-2 sentence description of each algorithm, including how they work and their time complexities.

Uploaded by

hari om
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

SN Sorting Algorithms Description

1 Bubble Sort It is the simplest sort method which performs sorting by repeatedly moving the largest element
to the highest index of the array. It comprises of comparing each element to its adjacent element
and replace them accordingly.
2 Bucket Sort Bucket sort is also known as bin sort. It works by distributing the element into the array also
called buckets. In this sorting algorithms, Buckets are sorted individually by using different
sorting algorithm.
3 Comb Sort Comb Sort is the advanced form of Bubble Sort. Bubble Sort compares all the adjacent values
while comb sort removes all the turtle values or small values near the end of the list.
4 Counting Sort It is a sorting technique based on the keys i.e. objects are collected according to keys which are
small integers. Counting sort calculates the number of occurrence of objects and stores its key
values. New array is formed by adding previous key elements and assigning to objects.
5 Heap Sort In the heap sort, Min heap or max heap is maintained from the array elements depending upon
the choice and the elements are sorted by deleting the root element of the heap.
6 Insertion Sort As the name suggests, insertion sort inserts each element of the array to its proper place. It is a
very simple sort method which is used to arrange the deck of cards while playing bridge.
7 Merge Sort Merge sort follows divide and conquer approach in which, the list is first divided into the sets of
equal elements and then each half of the list is sorted by using merge sort. The sorted list is
combined again to form an elementary sorted array.
8 Quick Sort Quick sort is the most optimized sort algorithms which performs sorting in O(n log n)
comparisons. Like Merge sort, quick sort also work by using divide and conquer approach.
9 Radix Sort In Radix sort, the sorting is done as we do sort the names according to their alphabetical order. It
is the linear sorting algorithm used for Integers.

You might also like