recategorized by
885 views
5 votes
5 votes
Given an array of n elements, where each element is at most k away from its target position, which algorithm is best suitable for sorting and what will be time complexity of the algorithm

( Note since pgee paper are not provided  I am unable to recall options)
recategorized by

2 Answers

Related questions

3 votes
3 votes
0 answers
1
Tesla! asked Apr 22, 2018
690 views
In a min-heap with $n$ elements with the smallest element at the root, the $7^{th}$ smallest element can be found in time$\Theta (n \log n)$$\Theta (n)$$\Theta(\log n)$$\...
2 votes
2 votes
0 answers
3