Register

Array

321 views
2 votes
2 votes

What is the worst case time complexity to sort on array A [0 to n] where the elements at index A [2i] (at even array index) is in its correct position ?

(a) O(n2)

(b) O(n log n)

(c) O(n)

User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
NeelParekh asked Jul 27, 2023
277 views
Algorithm Array Time complexity on splitting
If an array is split in the form of increasing and decreasing order then what is TC to find minimum element in the array?
If an array is split in the form of increasing and decreasing order then what is TC to find minimum element in the array?
User Avatar
0 votes
0 votes
3 answers
3
Subham Nagar asked Mar 20, 2018
1,246 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$...
User Avatar
3 votes
3 votes
1 answer
4
Sanjay Sharma asked Feb 20, 2018
1,106 views
An array A is of length n has log( n) distinct numbers. What is the time complexity
An array A is of length n has log( n) distinct numbers. What is the time complexity of sorting A by best comparison based algorithm ?
An array A is of length n has log( n) distinct numbers.What is the time complexity of sorting A by best comparison based algorithm ?
User Avatar
Link Copied!