 Practice
Resources
Contests
Online IDE
New
Free Mock
Events New Scaler
Practice
Improve your coding skills with our resources
Contests
Compete in popular contests with top coders Events
Attend free live masterclass hosted by top tech professionals
New
Scaler
Explore Offerings by SCALER ## Time Complexity

Last Updated: Nov 17, 2023
Go to Problems
Contents # Relevance of time complexity

Lets assume we ask 2 interviewees `A` and `B`to write a program to detect if a number `N >= 2` is prime.

A number is prime if it is divisible by exactly 2 distinct positive numbers 1 and the number itself.
https://www.mathsisfun.com/prime-composite-number.html

`A` comes up with the following code :

`````` i = 2
while i < N
if N is divisible by i
N is not prime

`B` comes up with the following code :

``````i = 2
while i <= square root of N
if N is divisible by i
N is not prime

For now, lets assume that both codes are correct.

Now, `B` claims that his code is much better as it takes much less time to check if `N` is prime.

Lets look into why that is the case.

Lets assume that the operation `N is divisible by i` takes 1 ms.

Lets look at few examples on time taken :

Example 1 :

``````N = 1000033 ( Prime number )
Time taken by A's program = 1 ms * number of divisions
= 1 ms * 1000033
= approximately 1000 seconds or 16.7 mins.

Time taken by B's program = 1ms * number of divisions
= 1ms * square root of 1000033
= approximately 1000ms = 1 second. ``````

Example 2 :

``````N = 1500450271 ( Prime number )
Time taken by A's program = 1 ms * number of divisions
= 1 ms * 1500450271
= approximately 1000000 seconds or 11.5 days

Time taken by B's program = 1ms * number of divisions
= 1ms * square root of 1500450271
= approximately 40000ms = 40 seconds.``````

As you can see B’s program is significantly faster even though both methods of solving the problem are correct.

This is where time complexity of programs comes in, which is a measure of how efficient ( or quick ) a program is for large inputs.

In first case, time taken is directly proportional to N, whereas in second case it is directly proportional to square root of N. In later slides, we will look into how we can formalize it into time complexity notations.

## Time Complexity Problems

0/4
Basic primer 0/4
Math 0/3
Compare functions 0/3
Function calling itself 0/1
Amortized complexity ## Video Courses By View All Courses Excel at your interview with Masterclasses Know More   Certificate included What will you Learn? Free Mock Assessment
Fill up the details for personalised experience.
Phone Number *
OTP will be sent to this number for verification
+1 *
+1
Change Number
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
*Enter the expected year of graduation if you're student
Current Employer
Company Name
College/University Name
Job Title
Job Title
Software Development Engineer (Backend)
Software Development Engineer (Frontend)
Software Development Engineer (Full Stack)
Data Scientist
Android Engineer
iOS Engineer
Devops Engineer
Support Engineer
Research Engineer
Engineering Intern
QA Engineer
Co-founder
SDET
Product Manager
Product Designer
Backend Architect
Program Manager
Release Engineer 