Types of Sorting: Internal and External

}

Akshamala

Insertion and Selection Sort

1. Selection sort finds the largest element in the array and exchanges it with the element in...}
   Akshamala

Exchange sort

1. In bubble sort, at each pass, the largest unsorted item will be pushed in its proper place....}
   Akshamala

Merge and Radix Sort

1. A divide and conquer algorithm works by recursively breaking down a problem into two or mor...}
   Akshamala

Shell sort

1. Shell sort works by comparing elements that are distinct rather than adjacent elements in a...}
   Akshamala

Heap Sort as a Priority Queue

1. In a heap, the largest/smallest node in the tree is always the root. 
2. A heap...}
   Akshamala

Big ‘O’ notation and Efficiency of sorting

1. In computer science,  Big O notation is used to classify and analyse algorithms by how...}
   Akshamala