Skip to content

Latest commit

 

History

History
52 lines (31 loc) · 11.9 KB

File metadata and controls

52 lines (31 loc) · 11.9 KB

Hey There!

This Repository contains Time and space complexity. Time and space complexity are terms used in computer science to analyze the efficiency of algorithms:

Time Complexity:

  1. Definition: It measures the amount of time an algorithm takes to complete as a function of the input size.
  2. Notation: Typically expressed using big-O notation (e.g., O(n), O(log n)).
  3. Example: An algorithm with O(n) time complexity means its running time grows linearly with the input size. If the input size doubles, the running time will roughly double as well.

Space Complexity:

  1. Definition: It quantifies the amount of memory space an algorithm uses in relation to the input size.
  2. Notation: Similar to time complexity, expressed using big-O notation.
  3. Example: An algorithm with O(n) space complexity implies that the amount of memory it uses grows linearly with the input size. If the input size increases, the algorithm's memory consumption will increase proportionally.

Please start practicing to my Youtube Channel

Lectures Video Link Video PDF
1) Introduction of DSA start practicing
start practicing
2) What is Algorithm? start practicing
start practicing
3) Asymptotic notation Big-O start practicing
start practicing
4) Asymptotic notation Big Omega start practicing
start practicing
5) Asymptotic notation Theta start practicing
start practicing
6) Best case, Worst case, Average Case start practicing
start practicing
7) Properties of Asymptotic Notation start practicing
start practicing
8) How to find Time Complexity Part 1 start practicing
start practicing
9) How to find Time Complexity Part 2 start practicing
start practicing
10) How to find Space Complexity start practicing
start practicing
11) Compare the class of function start practicing
start practicing

Connect with me:

start practicing i._am._arfin start practicing Arfin Parween