Question 2 (1 mark) Consider the following array: { (5, b), (8, a), (3, a), (3, c), (4, b), (5, a), (8, b), (5, c), (2, a), (3, b) } If we sort the array by the first element of each pair (i.e., the number) in ascending order using an unstable sorting algorithm, how many possible results are there? Enter integer Question 3 (1 mark) Consider the following array: { 1, 7, 4, 8, 5, 3 } How many comparisons between array elements are made if the array is sorted using selection sort? Enter integer
Added by David Q.
Close
Step 1
First, we need to identify the pairs in the array: { (5,b), (8,a), (3,a), (3,c), (4,b), (5,a), (8,b), (5,c), (2,a), (3,b) } Show more…
Show all steps
Your feedback will help us improve your experience
Akash M and 99 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Consider the algorithm for the sorting problem that sorts an array by counting, for each of its elements, the number of smaller elements and then uses this information to put the element in its appropriate position in the sorted array: Algorithm ComparisonCountingSort(A[0..n-1], S[0..n-1]) // Sorts an array by comparison counting // Input: Array A[0..n-1] of orderable values // Output: Array S[0..n-1] of A's elements sorted in nondecreasing order for i = 0 to n-1 do Count[i] = 0 for i = 0 to n-2 do for j = i+1 to n-1 do if A[i] < A[j] Count[j] = Count[j] + 1 else Count[i] = Count[i] + 1 for i = 0 to n-1 do S[Count[i]] = A[i] return S a. Apply this algorithm to sorting the list 60, 35, 81, 98, 14, 47 b. Is this algorithm stable? c. Is it in place?
Akash M.
'Write a program segment that will perform Selection Sort Method in sorting the elements of Array B in ascending order where array B is declared as follows int B[S] = {5,4,1,3,2 } (Start the comparison from the last 2 elements of the array)'
Mohan J.
Find the least number of comparisons needed to sort five elements and devise an algorithm that sorts these elements using this number of comparisons.
Trees
Applications of Trees
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD