Time complexity

Deepalitrapti asked Sep 1, 2018 • retagged Jun 13, 2022 by makhdoom ghaya

855 views

0 votes

Algorithms
time-complexity
array
algorithm-design

+ –

Deepalitrapti asked Sep 1, 2018 • retagged Jun 13, 2022 by makhdoom ghaya

Deepalitrapti

855 views

See all

13 13 Comments

Show 10 previous comments

air1ankit

commented Sep 2, 2018

Well explanation bro @shaikmasthan

0 votes

Shaik Masthan

commented Sep 2, 2018

we can't apply binary search, due to array is not sort.

But we know that n is fixed ===> apply counting sort ==> O(n)

then again with a for loop, we can know which is missing ===> O(n)

O(n)+O(n) = O(n)

0 votes

mrinmoyh

commented Sep 17, 2020

XOR method is also interesting-

https://www.geeksforgeeks.org/find-the-missing-number/

0 votes

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Voting & Accepting an answer helps improve the community

← Previous Next →

← Previous in category Next in category →

Related questions

1 votes

1 answer

Anilava Kundu asked Jan 17, 2019

1,323 views

Time complexity
What is the worst case time complexity to count pairs of numbers with difference ‘k’ from an input array of ‘n’ numbers O(log n) O(n log n) O(n)^2 O(n^2 log n) The answer given was B but since worst case time is stated shouldn't the answer be C? I mean we can check all possible pairs in the worst case. Correct me if I am wrong?

What is the worst case time complexity to count pairs of numbers with difference ‘k’ from an input array of ‘n’ numbers O(log n)O(n log n)O(n)^2O(n^2 log n)The an...

Anilava Kundu

1.3k views

Anilava Kundu asked Jan 17, 2019

Algorithms
algorithms
time-complexity
algorithm-design

+ –

2 votes

1 answer

Ray Tomlinson asked Aug 9, 2023

877 views

Made Easy Test Series
You are given an array of elements where each array element represents the MAXIMUM number of jumps that can be made in the forward direction from that element. Now, consider the following array: {1, 3, 5, 8, 9, 2, 6, 7, 6). What is the minimum number of jumps required to reach the end of the array?

You are given an array of elements where each array element represents the MAXIMUM number of jumps that can be made in the forward direction from that element. Now, consi...

Ray Tomlinson

877 views

Ray Tomlinson asked Aug 9, 2023

Algorithms
made-easy-test-series
made-easy-booklet
algorithms
data-structures
array
algorithm-design

+ –

0 votes

1 answer

Learner_jai asked Nov 27, 2018

489 views

Interview Question
Given an Unsorted array, Find maximum in less than O(n) time? How can we do this?

Given an Unsorted array, Find maximum in less than O(n) time?How can we do this?

Learner_jai

489 views

Learner_jai asked Nov 27, 2018

Algorithms
interview
array
algorithm-design

+ –

0 votes

3 answers

Subham Nagar asked Mar 20, 2018

1,253 views

Ace Test Series: Algorithms - Time Complexity & Array
An array $'A'$ has $n$ distinct integers. What is the tightest time complexity to check $A[i]=i$ for some $i$. Consider all elements of array within range from $1$ to $n$. $O(n^2) $ $O(1)$ $O(n)$ $O(logn)$

An array $'A'$ has $n$ distinct integers. What is the tightest time complexity to check $A[i]=i$ for some $i$. Consider all elements of array within range from $1$ to $n$...

Subham Nagar

1.3k views

Subham Nagar asked Mar 20, 2018

Algorithms
algorithms
ace-test-series
time-complexity
array

+ –

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

13 13 Comments reply

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Related questions

13 13 Comments