Scribd
Upload
23 views

Sorting Algorithm: 1. Heapsorting Heap Sort Is A Comparison Based Sorting Technique Based On Binary Heap Data

The document discusses six different sorting algorithms: heap sort, insertion sort, merge sort, quick sort, selection sort, and shell sort. Heap sort uses a binary heap data structure to find the maximum element and place it at the end of the sorted list. Insertion sort builds a sorted list one item at a time by inserting each element into the correct position. Merge sort divides the array into halves and then merges the sorted halves together. Quick sort uses partitioning to separate elements into two arrays based on a pivot value. Selection sort finds the minimum element and swaps it with the first unsorted element. Shell sort improves on insertion sort by using smaller intervals to avoid large shifts of elements.

Uploaded by

Rafraf Gayatao
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
23 views

Sorting Algorithm: 1. Heapsorting Heap Sort Is A Comparison Based Sorting Technique Based On Binary Heap Data

The document discusses six different sorting algorithms: heap sort, insertion sort, merge sort, quick sort, selection sort, and shell sort. Heap sort uses a binary heap data structure to find the maximum element and place it at the end of the sorted list. Insertion sort builds a sorted list one item at a time by inserting each element into the correct position. Merge sort divides the array into halves and then merges the sorted halves together. Quick sort uses partitioning to separate elements into two arrays based on a pivot value. Selection sort finds the minimum element and swaps it with the first unsorted element. Shell sort improves on insertion sort by using smaller intervals to avoid large shifts of elements.

Uploaded by

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

Raffy Christ F.

Gayatao Data Structure And Algorithm

BSCS -2A Mrs.Maribel Cardona

Sorting Algorithm
1. HeapSorting
 Heap Sort is a comparison based sorting technique based on Binary Heap data
structure. It is similar to selection sort where we first find the maximum element
and place the maximum element at the end. We repeat the same process for the
remaining elements. A Binary Heap is a Complete Binary Tree where items are
stored in a special order such that value in a parent node is greater(or smaller) than
the values in its two children nodes. The former is called as max heap and the latter
is called min-heap. The heap can be represented by a binary tree or array.

2. Insertion Sorting
 Insertion Sort is a sorting algorithm in which the elements are transferred one at a
time to the right position. In other words, an insertion sort helps in building the
final sorted list, one item at a time, with the movement of higher-ranked elements.
An insertion sort has the benefits of simplicity and low overhead. In an insertion
sort, the first element in the array is considered as sorted, even if it is an unsorted
array. In an insertion sort, each element in the array is checked with the previous
elements, resulting in a growing sorted output list. With each iteration, the sorting
algorithm removes one element at a time and finds the appropriate location within
the sorted array and inserts it there. The iteration continues until the whole list is
sorted.

3. Merge Sorting
 Merge Sort is a function repeatedly divides the array into two halves until we
reach a stage where we try to perform MergeSort on a subarray . First ,divides the
array into equal halves and then combines them in a sorted manner then merge the
smaller lists into new list in sorted order.
4. Quick Sorting

 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.Quicksort partitions an array and then calls itself recursively twice to sort the
two resulting subarrays. This algorithm is quite efficient for large-sized data sets
as its average and worst-case complexity.

5. Selection Sorting
 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.The smallest element is selected from
the unsorted array and swapped with the leftmost element, and that element
becomes a part of the sorted array. This process continues moving unsorted array
boundary by one element to the right.

6. Shell Sorting

 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.This algorithm
uses insertion sort on a widely spread elements, first to sort them and then sorts the
less widely spaced elements. This spacing is termed as interval.

You might also like