Register

efficient algo for nearly sorted array

• retagged by
776 views

1 Answer

0 votes
0 votes
infact insertion sort can do it in O(n) time i think.. all others will take relativvely more time.
• edited by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
2
Purple asked Jan 27, 2016
24,719 views
If the number of records to be sorted is small, then which sorting can is efficient?
If the number of records to be sorted is small, then ...... sorting can be efficient. A. Merge B. Heap C. Insertion D. Bubble
If the number of records to be sorted is small, then ...... sorting can be efficient.A. MergeB. HeapC. InsertionD. Bubble
User Avatar
8 votes
8 votes
2 answers
3
radha gogia asked Jul 19, 2015
20,228 views
Given an unsorted array. The array has this property that every element in array is at most k distance from its position in sorted array where k is a positive integer smaller than size of array. Which sorting algorithm can be easily modified for sorting this array and what is the obtainable time complexity?
(A) Insertion Sort with time complexity O(kn)(B) Heap Sort with time complexity O(nLogk)(C) Quick Sort with time complexity O(kLogk)(D) Merge Sort with time complexity O(...
User Avatar
3 votes
3 votes
3 answers
4
Himanshu1 asked Dec 16, 2015
1,599 views
median of two sorted Arrays
User Avatar
Link Copied!