Heap sort is based exclusively upon a binary heap data structure, where we find the largest element and sort it to the end of an unsorted collection. We use the properties of a complete binary tree to sort our collection efficiently.
Quick sort uses the divide-and-conquer approach based on the idea of choosing a pivot element from the array and partitioning the array around it where the Left side of pivot contains elements that are smaller than the pivot and Right side contains elements greater than the pivot.
Linear search is used to find a particular element in a list or collection of items.
Target element is compared sequentially with each element of a collection until it is found. Otherwise it will traverse through that list until it reaches to the end of the list.