Given the following array: int a[8] = {41, 32, 5, 8, 7, 50, 11, 49}; What...
Given the following array:
int a[8] = {41, 32, 5, 8, 7, 50, 11, 49};
What does the array look like after the first swap
of a Selection Sort in descending
order?
Homework Answers
Answer:-
After the first swap of a selection sort in decending order is int a[8] = {50, 32, 5, 8, 7, 41, 11, 49};
here larger value swap from first element of array
Add Answer to:
Given the following array:
int a[8] = {41, 32, 5, 8, 7, 50, 11, 49};
What...
PROBLEM #11 What are the two algorithms used to sort an array? How do they work?...
PROBLEM #11 What are the two algorithms used to sort an array? How do they work? -------------------------------------------------------------------- */ /* --------------------------------------------------------------------------------------------------------------- PROBLEM #12 Given the following array 'jumbled', what will the array be after the first swap of a selection sort algorithm? (Assume the algorithm sorts in ascending order). --------------------------------------------------------------------------------------------------------------- */ int jumbled[] = {12, 5, 3, 1, 9, 100, 45}; /* --------------------------------------------------------------------------------------------------------------- PROBLEM #13 Given the following array 'jumbled2', what will the array be after the third swap of a...
Using an insertion sort, sort the array 5, 7, 4, 9, 8, 6, 3 into ascending...
Using an insertion sort, sort the array 5, 7, 4, 9, 8, 6, 3 into ascending order. After the first swap, what will the array look like?
Given a bubble sort and the following array: [10,7,19,5,16] What are the values after the first...
Given a bubble sort and the following array: [10,7,19,5,16] What are the values after the first iteration? Given an insertion sort and the following array: [50,5,35,70,6] What does the array look like after the first insertion: Fill in the missing code for InsertionSort method // Insertion Sort method //sorts an array of Auto objects public static void insertionSort(Auto [] arr) { Auto temp; int j; for (int i=1; i<arr.length; i++) { j=i; temp=arr[i]; while (j!=0 &&(temp.getModel().compareTo(arr[[j-1].getModel())<0)...
[5 marks] Using selection sort algorithm to sort the array int array[7]-5, 6, 2, 7, 9,...
[5 marks] Using selection sort algorithm to sort the array int array[7]-5, 6, 2, 7, 9, 4, 3). Assuming we call the following function using statement selection sort (int array, 7); Please fill the table to show the changes of the array int_array after each iteration. The first column is filled. void selection_sort (int list[], int list_size) for (int i = 0; i < list size - 1; 1++) int current min = list[1]; int current_min_index-i for (int j -...
11. (9 pts) Below is a picture of an array of ints. Show what the array...
11. (9 pts) Below is a picture of an array of ints. Show what the array would look like during the first three passes (i.e., the first three executions of the inner loop) of each of the sort algorithms listed below. . Insertion sort 54 23 89 14 7190 88 41 61 31 Selection sort 54 23 8914 71 90 8841 61 31 Bubble sort 54 238914 71 90 884161 31
int[] arr ={4, 7, 4, 15, 37, 5, 9, 42, 50, 50}; D. Show what the...
int[] arr ={4, 7, 4, 15, 37, 5, 9, 42, 50, 50}; D. Show what the array representation and tree representation look like after you remove the minimum element from this min heap? (5 points)
Sorting Sort the following array using the quick sort algorithm: (4 Marks) a. 12 26 8...
Sorting Sort the following array using the quick sort algorithm: (4 Marks) a. 12 26 8 9 7 0 4 Pivot selection is defined to be the first element of each sub-list. Show the array before and after each quicksort round (when the array is partitioned after placing the pivot at its correct position). Also, clearly highlight the pivot in each partition b. Consider an unsorted array of integers of size n. Write a Java program to arrange the array...
5) Given the data array 32 33 35 39 40 41 42 42 43 45 49...
5) Given the data array 32 33 35 39 40 41 42 42 43 45 49 78 93 a) Give Five Number Summary b) Draw a boxplot. c) Calculate the InterQuartile Range, the Upper Fence, the Lower Fence d) Check for outliers
8. (5 points) Trace merge sort algorithm as it sorts the following sequence of integer array into...
8. (5 points) Trace merge sort algorithm as it sorts the following sequence of integer array into a descending order. 42 45 10 64 55 37 96 7 9. (5 points) Trace shell sort algorithm that halves the gap size at each iteration as it sorts the following sequence of integer array into an ascending order. 42 18 10 64 85 37 96 71
8. (5 points) Trace merge sort algorithm as it sorts the following sequence of integer array...
Refer to the following array definition for questions 1 & 2 int numberArray[9)[11] 1. Write a...
Refer to the following array definition for questions 1 & 2 int numberArray[9)[11] 1. Write a statement that assigns 145 to the first column of the first row of this array. 2. Write a statement that assigns 18 to the last column of the last row of this array. values is a two-dimensional array of floats, with 10 rows and 20 columns. Write code that sums all of the elements in the array and stores the sum in the variable...
[5 marks] Using selection sort algorithm to sort the array int array[7]-5, 6, 2, 7, 9, 4, 3). Assuming we call the following function using statement selection sort (int array, 7); Please fill the table to show the changes of the array int_array after each iteration. The first column is filled. void selection_sort (int list[], int list_size) for (int i = 0; i < list size - 1; 1++) int current min = list[1]; int current_min_index-i for (int j -...
11. (9 pts) Below is a picture of an array of ints. Show what the array would look like during the first three passes (i.e., the first three executions of the inner loop) of each of the sort algorithms listed below. . Insertion sort 54 23 89 14 7190 88 41 61 31 Selection sort 54 23 8914 71 90 8841 61 31 Bubble sort 54 238914 71 90 884161 31
int[] arr ={4, 7, 4, 15, 37, 5, 9, 42, 50, 50}; D. Show what the array representation and tree representation look like after you remove the minimum element from this min heap? (5 points)
Sorting Sort the following array using the quick sort algorithm: (4 Marks) a. 12 26 8 9 7 0 4 Pivot selection is defined to be the first element of each sub-list. Show the array before and after each quicksort round (when the array is partitioned after placing the pivot at its correct position). Also, clearly highlight the pivot in each partition b. Consider an unsorted array of integers of size n. Write a Java program to arrange the array...
5) Given the data array 32 33 35 39 40 41 42 42 43 45 49 78 93 a) Give Five Number Summary b) Draw a boxplot. c) Calculate the InterQuartile Range, the Upper Fence, the Lower Fence d) Check for outliers
8. (5 points) Trace merge sort algorithm as it sorts the following sequence of integer array into a descending order. 42 45 10 64 55 37 96 7 9. (5 points) Trace shell sort algorithm that halves the gap size at each iteration as it sorts the following sequence of integer array into an ascending order. 42 18 10 64 85 37 96 71
8. (5 points) Trace merge sort algorithm as it sorts the following sequence of integer array...
Refer to the following array definition for questions 1 & 2 int numberArray[9)[11] 1. Write a statement that assigns 145 to the first column of the first row of this array. 2. Write a statement that assigns 18 to the last column of the last row of this array. values is a two-dimensional array of floats, with 10 rows and 20 columns. Write code that sums all of the elements in the array and stores the sum in the variable...
Most questions answered within 3 hours.
-
If you could afford exactly 6 apples and 14 bananas, or 10
apples and 6 bananas,...
asked 11 minutes ago -
Write functions squareByValue,
squareByRef, squareByPointer that find the square of an integer, in
three different ways:...
asked 6 minutes ago -
Find the P - value for the test statistic ?=2.74z=2.74
for the following null and alternative...
asked 12 minutes ago -
An software company has three different promotion plans for
its software purchase:
plan A: each software...
asked 31 minutes ago -
If
P(A)=.62, P(B)=.47, & P(A or B)=.88. What is the likeliness of
selecting only A?
A)...
asked 31 minutes ago -
What is the FUTURE VALUE of $500 invested for 3 years at 7% with
ANNUAL Compounding...
asked 40 minutes ago -
Modify the method so that instead of manually making teams, it
reads it from a text...
asked 39 minutes ago -
1. Which of the following is not a principle to apply to
construction:
Select one:
a....
asked 40 minutes ago -
In what way is a Christian’s position made more challenging by
revealing faith in the workplace?...
asked 48 minutes ago -
1) There are four categories of customer benefits in B2B
(business-to-business) markets. Which of the following...
asked 45 minutes ago -
What is the pH of a 150.0 mL solution of 0.0273 M NaOH (strong
base)?
asked 54 minutes ago -
A thin ball shell is shaped like a hollow ball with a radius of
26.6 cm....
asked 1 hour ago