ProDeveloperTutorial.com

Tutorials and Programming Solutions
Menu
  • Top Coding Questions
    • Recursive or DFS
    • Strings
    • Matrix
    • Divide and conquer
    • Bit Manipulation
    • Backtracking
    • Linked list
    • Array
    • Dynamic programming
    • Two pointers
  • Tutorials
    • Shell Scripting
    • System Design

Sorting and Searching algorithms full list

Sorting Algorithm Introduction

What is sorting?

Sorting is a technique to arrange elements in ascending or descending order.

Why sorting is important in Computer Science?
Suppose you have a large amount of data and you want to find the minimum and maximum element. If the data is not sorted, it will be difficult to find these elements. Because they might be present at any position.

Hence if the data is sorted we can directly select the first and last element to get minimum and maximum values. If the data is sorted in ascending order.

Below is the list of sorting algorithm that we are going to learn.

Search website

Pages

  • About and Contact Us
  • Affiliate Disclosure
  • Aj’s guide for C programming for beginners
  • Aj’s guide to C++ Programming for beginners
  • AJ’s guide to Data Structures and Algorithms. The complete Guide from beginner to expert.
  • C language tutorial for beginners
  • Frequently asked Competitive Programming Coding Interview Questions and their solutions
  • Privacy policy
  • Sorting and Searching algorithms full list

ProDeveloperTutorial.com

Tutorials and Programming Solutions

Recent Posts

  • Searching Algorithm 6: Ternary Search
  • Searching Algorithm 5: Exponential Search
  • Searching Algorithm 4: Interpolation Search
  • Sorting algorithm 14: Comb Sort
  • Sorting algorithm 13: Topological Sort
Copyright © 2019 ProDeveloperTutorial.com
Theme by MyThemeShop.com