Time Complexity of Sortings

-

 Time Complexity of  Sorting Algorithm....

 

  •  Bubble Sort 
  • Selection Sort 
  • Insertion Sort 
these above have time complexity of order  = O(n*n).
  •  Merge sort
  • Quick sort
these have the time complexity of order = O(n(logn)).
  •  count sort
this has the time complexity of order = O(n). 
 
💥 Note :
 
👉Time Complexity of order O(n) is called Best  case.
👉 Time Complexity of order O(n(logn) is called Average  case.
👉Time Complexity of order O(n*n) is called Worst  case.
 

Comments

Post a Comment

Popular posts from this blog

Storage Class in C

-
Image
          Storage Class in C Programming                                                (variable storage class)                          From compiler point of view, a variable name identify some physical location in any computer when a string of bits representing a variables value stored. There are basically two kind of location in computer where such values are stored - 1. CPU Registers 2. Main Memory                        It is variable storage class that determine in which of these two types of location, ...
Read more

Handwritten Digits Recognition using Machine Learning

-
Image
      Recognizing Handwritten Digits with scikit-learn                                   In this project we will try to recognize handwritten digits using machine learning models like support vector machine and random forest classifier with the help of scikit-learn library. Handwriting Recognition                                  Handwritten text recognition is one of the most challenging task so to address this issue scikit-learn library plays important role to better understanding this technique. But people often think about OCR (Optical Character Recognition) software that can read text, pdf or other electronic documents. But this problem by choosing statistical approach may be optimal solution. You can read about scikit-learn library from this  scikit-learn: mac...
Read more