Partitioning-Algorithm

Question 1
Suppose you are provided with the following function decleration in the C programming language.
A
(a, left_end, k) and (a + left_end + 1, n – left_end – 1, k – left_end – 1)
B
(a, left_end, k) and (a, n – left_end – 1, k – left_end – 1)
C
(a + left_end + 1, n – left_end – 1, k – left_end – 1) and (a, left_end, k)
D
(a, n – left_end – 1, k – left_end – 1) and (a, left_end, k)
       Algorithms       Partitioning-Algorithm       GATE 2015 -(Set-2)
Question 1 Explanation: 
QuickSort is used as a sorting algorithm.In QuickSort, we pick a pivot element, then move the pivot element to its correct position and partition the array around it. The idea is, not to do complete quicksort, but stop at the point where pivot itself is k’th smallest element. Also, not to recur for both left and right sides of pivot, but recur for one of them according to the position of pivot.
There is 1 question to complete.
PHP Code Snippets Powered By : XYZScripts.com