Skip to content

Latest commit

 

History

History
 
 

Searching_Sorting

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
Binary_search.java
Binary_search.java
 
 
dnf_sort.cpp
dnf_sort.cpp
 
 
fibonacci_search.cpp
fibonacci_search.cpp
 
 
readme.md
readme.md
 
 

readme.md

Sorting

Sorting is an algorithm that arranges the elements of a list in a certain order [either ascending or
descending]. The output is a permutation or reordering of the input.

Why is Sorting Necessary?

Sorting is one of the important categories of algorithms in computer science and a lot of research
has gone into this category. Sorting can significantly reduce the complexity of a problem, and is
often used for database algorithms and searches.

Classification of Sorting Algorithms

Sorting algorithms are generally categorized based on the following parameters.

  • By Number of Comparisons : In this method, sorting algorithms are classified based on the number of comparisons. For comparison based sorting algorithms, best case behavior is O(nlogn) and worst case behavior is O(n 2 ). Comparison-based sorting algorithms evaluate the elements of the list by key comparison operation and need at least O(nlogn) comparisons for most inputs.

  • By Number of Swaps : In this method, sorting algorithms are categorized by the number of swaps (also called inversions).

  • By Memory Usage : Some sorting algorithms are in place and they need O(1) or O(logn) memory to create auxiliary locations for sorting the data temporarily.

  • By Recursion : Sorting algorithms are either recursive quick sort or non-recursive selection sort, and insertion sort, and there are some algorithms which use both (merge sort).

  • By Stability : Sorting algorithm is stable if for all indices i and j such that the key A[i] equals key A[j], if record R[i] precedes record R[j] in the original file, record R[i] precedes record R[j] in the sorted list. Few sorting algorithms maintain the relative order of elements with equal keys (equivalent elements retain their relative positions even after sorting).

  • By Adaptability : With a few sorting algorithms, the complexity changes based on pre-sortedness [quick sort]: pre- sortedness of the input affects the running time. Algorithms that take this into account are known to be adaptive.

Searching

Searching is one of the core computer science algorithms. We know that today’s computers store a lot of information. To retrieve this information proficiently we need very efficient searching algorithms. There are certain ways of organizing the data that improves the searching process. That means, if we keep the data in proper order, it is easy to search the required element. Sorting is one of the techniques for making the elements ordered.

Types of Searching

Following are the types of searches which we will be discussing in this book.

  • Unordered Linear Search ----> C++
  • Sorted/Ordered Linear Search
  • Binary Search
  • Interpolation search
  • Binary Search Trees
  • Symbol Tables and Hashing
  • String Searching Algorithms: Tries, Ternary Search and Suffix Trees

Questions :

  • Binary Search ----> Python | Java
  • Book Allocation ----> Java
  • Bucket Sort ----> Java
  • Circle Sort ----> C++
  • Counting Sort ----> C++
  • Cycle Sort ----> C++
  • DNF SORT ----> C++
  • Fibonacci Search ----> C++
  • Find peak element using binary search ----> Python
  • Heap Sort ----> C++
  • In Place Merge Sort ----> C++
  • Insertion Sort ----> C++
  • Linear Search ----> Python
  • Merge Sort ----> C++
  • Number of times sorted array rotated ---->C++
  • Painter's Partition -->C++
  • Peak Element's Index ---->C++
  • Quick Sort ----> C++
  • Rabin Karp Algorithm ----> C++
  • Searching in sorted rotated array ----> Java
  • Selection Sort ----> C++
  • Shell Sort ----> C++
  • Staircase Search ----> C++
  • Three Way Merge Sort ----> C++
  • Tim Sort ----> C++