Register

MadeEasy Test Series: Algorithms - Time Complexity

• edited by
816 views
1 votes
1 votes

• edited by
User Avatar

1 Answer

1 votes
1 votes
One solution can be to linearly traverse the entire array and find the missing number. Here time complexity is O(n).

We can get this in O(Logn) time using the modification of the Binary Search algorithm
We can get the middle element and find if it lies in between before mid or the after mid. This way we are reducing the size of our array to half everytime and hence the answer is O(Logn)
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
Markzuck asked Jan 6, 2019
507 views
MadeEasy Test Series: Algorithms - Time Complexity
Please show the ideal way to deal with such comparisons as I am getting g>=f IN genral what logic shall be followed to analyse such complex comparions?
Please show the ideal way to deal with such comparisons as I am getting g>=f IN genral what logic shall be followed to analyse such complex comparions?
User Avatar
0 votes
0 votes
1 answer
2
Markzuck asked Dec 29, 2018
804 views
MadeEasy Test Series 2019: Algorithms - Time complexity
cant we write the recurrance relation for bar() as T(n) = 5T(n-1) + c, like cant we take both the recurrance call as combined as both have same parameter? and if not, then how to solve such?
cant we write the recurrance relation for bar() as T(n) = 5T(n-1) + c,like cant we take both the recurrance call as combined as both have same parameter?and if not, then ...
User Avatar
1 votes
1 votes
0 answers
3
amit166 asked Nov 24, 2018
304 views
MadeEasy Test Series: Algorithms - Time Complexity
T(n)=T(n+1)+n+1 time complexity
T(n)=T(n+1)+n+1 time complexity
User Avatar
0 votes
0 votes
1 answer
4
Shamim Ahmed asked Nov 22, 2018
1,091 views
MadeEasy Test Series: Algorithms - Time Complexity
For merging two unsorted list of size m and n into sorted list of size (m+n). The time complexity in terms of no. of comparison for this is?
For merging two unsorted list of size m and n into sorted list of size (m+n). The time complexity in terms of no. of comparison for this is?
User Avatar
Link Copied!