Register

HEY ,Bad Request Your browser sent a request that this server could not understand. Size of a request header field exceeds server limit. Apache/2.4.41 (Ubuntu) Server at aptitude.gateoverflow.in Port 443

151 views
0 votes
0 votes
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

540
views
1 answers
0 votes
dhruba asked May 29, 2023
540 views
Consider a divide and conquer algorithm that divides an input of size n into a subproblems, each of size n/b, and the cost of dividing and merging the problems is given by f(n) = Θ(n^c). The Master Theorem classifies this into different cases based on the value of c in relation to log_b(a). Could you explain the intuition and reasoning behind these classifications?
Consider a divide and conquer algorithm that divides an input of size n into a subproblems, each of size n/b, and the cost of dividing and merging ... to log_b(a). Could you explain the intuition and reasoning behind these classifications?
User Avatar
20.9k
views
2 answers
8 votes
radha gogia asked Jul 19, 2015
20,949 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(kLogk) what is the approach of doing this question ?
User Avatar
Link Copied!