Microsoft
98-361 · Question #359
98-361 Question #359: Real Exam Question with Answer & Explanation
Sign in or unlock 98-361 to reveal the answer and full explanation for question #359. The question stem and answer options stay visible for context.
Question
You are developing a sorting algorithm that uses partitioning and comparison to arrange an array of numbers in the correct order. You write a method that partitions the array so that the items less than pivot go to the left side, whereas the items greater than pivot go to the right side. The partitioning method has the following signature: - static int Partition (int[] numbers, int left, - int right, int pivotIndex) Which of the following algorithms should you use to sort the array using the Partition method?
Options
- Astatic int[] QuickSort(int[] numbers,
- Bstatic int[] QuickSort(int[] numbers,
- Cstatic int[] QuickSort(int[] numbers,
- Dstatic int[] QuickSort(int[] numbers,
Unlock 98-361 to see the answer
You've previewed enough free 98-361 questions. Unlock 98-361 for full answers, explanations, the timed quiz mode, progress tracking, and the master PDF. Question stem and options stay visible so you can still see what's on the exam.