Homework Answers
a. array after every i-loop iteration :
8 9 6 7 4 5 2 3
6 8 9 7 4 5 2 3
6 7 8 9 4 5 2 3
4 6 7 8 9 5 2 3
4 5 6 7 8 9 2 3
2 4 5 6 7 8 9 3
2 3 4 5 6 7 8 9
b. Total 24 comparision are made for this specific array
c. Best - n
Worst - n^2
Average - n^2
************Comment me for any Queries and Rate me up************
Add Answer to:
4. Use the Insertion Sort algorithm to sort the following array in nondecreasing order. arr =...
Recall the insertion sort algorithm as discussed in this chapter. Assume the following list of keys:...
Recall the insertion sort algorithm as discussed in this chapter. Assume the following list of keys: 30, 20, 35, 27, 96, 82, 60, 48, 75, 5, 80 Exactly how many key comparisons are executed to sort this list using insertion sort? Show the values and the number of comparisons after each iteration for the loop.
1.Show the state of the following array after the outer loop of the bubble sort algorithm...
1.Show the state of the following array after the outer loop of the bubble sort algorithm has executed one time. [0] [1] [2] [3] [4] [5] 19 23 2 4 99 1 2. Show the state of the following array after the outer loop of the selection sort algorithm has executed two times. [0] [1] [2] [3] [4] [5] 12 1 9 23 17 11 3. Show the state of the following array after the outer loop of the insertion...
3. Modify the insertion sort algorithm discussed in class so that it can sort strings. That...
3. Modify the insertion sort algorithm discussed in class so
that it can sort strings. That is, its input will be an array, the
type of which is string. The insertion sort algorithm will sort the
elements in this array. Finally, its output will be a sorted
array.
As the solution of this problem, you need to submit the
following answer(s): (1). The implementation of your algorithm in
C# (20points).
Algorithm: At each array-position, it checks the value there against...
(15 points) Consider the algorithm for insertion sort shown below. The input to this algorithm is...
(15 points) Consider the algorithm for insertion sort shown below. The input to this algorithm is an earray A. You must assume that indexing begins at 1. 1: for j = 2: A.length do key = A i=j-1 while i > 0 and A[i] > key do Ali + 1] = Ai i=i-1 7: A[i+1] = key (a) Follow this algorithm for A[1..4) =< 7,9,6,8 >. Specifically, please indicate the contents of the array after each iteration of the outer...
. Shell sort is a sorting algorithm similar to insertion sort. Research shell sort and apply...
. Shell sort is a sorting algorithm similar to insertion sort. Research shell sort and apply that to the following array. Show your work in Detail. [15 points] 45 20 50 10 80 30 60 70 40 90 2. Is Shell sort a stable sorting algorithm? Answer this with an example. [10 points] 3. Apply Merge Sort to sort the following list. Show your work in Detail. [15 Points] 45 20 50 10 80 30 60 70 40 90 4....
2. Consider your ID as an array of 9 elements, apply an insertion sort algorithm to...
2. Consider your ID as an array of 9 elements, apply an insertion sort algorithm to sort the numbers in descending order. Show your steps. Example ID: 201710340 Array: 2 0 7 0 1 1 0 3 4
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)...
Problem 4: Sorting and Searching (55 points) a) (20 points) Scarch for the character K using...
Problem 4: Sorting and Searching (55 points) a) (20 points) Scarch for the character K using the binary search algorithm on the following array of characters: KM 2. R For each iteration of binary search use the table below to list: (a) the left index and (b) the right index of the array that denote the region of the array that is still being searched, (c) the middle point index of the array, and (d) the number of character-to-character comparisons...
7. (14 points) Use LSD-first Radix Sort algorithm to sort the following array of numbers. Write...
7. (14 points) Use LSD-first Radix Sort algorithm to sort the following array of numbers. Write the worst case, the best case time complexity and discuss if these sorting algorithms are stable and in-place? In what cases using these algorithms would not be efficient? (You must run Counting Sort for each digit explicitly.) A=[22,15,16,13,23,45,0,23,123]
6. (10 points) Trace insertion sort algorithm as it sorts the following sequence of integer array...
6. (10 points) Trace insertion sort algorithm as it sorts the following sequence of integer array into an ascending order. 17 3 12
Recall the insertion sort algorithm as discussed in this chapter. Assume the following list of keys: 30, 20, 35, 27, 96, 82, 60, 48, 75, 5, 80 Exactly how many key comparisons are executed to sort this list using insertion sort? Show the values and the number of comparisons after each iteration for the loop.
3. Modify the insertion sort algorithm discussed in class so
that it can sort strings. That is, its input will be an array, the
type of which is string. The insertion sort algorithm will sort the
elements in this array. Finally, its output will be a sorted
array.
As the solution of this problem, you need to submit the
following answer(s): (1). The implementation of your algorithm in
C# (20points).
Algorithm: At each array-position, it checks the value there against...
(15 points) Consider the algorithm for insertion sort shown below. The input to this algorithm is an earray A. You must assume that indexing begins at 1. 1: for j = 2: A.length do key = A i=j-1 while i > 0 and A[i] > key do Ali + 1] = Ai i=i-1 7: A[i+1] = key (a) Follow this algorithm for A[1..4) =< 7,9,6,8 >. Specifically, please indicate the contents of the array after each iteration of the outer...
2. Consider your ID as an array of 9 elements, apply an insertion sort algorithm to sort the numbers in descending order. Show your steps. Example ID: 201710340 Array: 2 0 7 0 1 1 0 3 4
Problem 4: Sorting and Searching (55 points) a) (20 points) Scarch for the character K using the binary search algorithm on the following array of characters: KM 2. R For each iteration of binary search use the table below to list: (a) the left index and (b) the right index of the array that denote the region of the array that is still being searched, (c) the middle point index of the array, and (d) the number of character-to-character comparisons...
7. (14 points) Use LSD-first Radix Sort algorithm to sort the following array of numbers. Write the worst case, the best case time complexity and discuss if these sorting algorithms are stable and in-place? In what cases using these algorithms would not be efficient? (You must run Counting Sort for each digit explicitly.) A=[22,15,16,13,23,45,0,23,123]
6. (10 points) Trace insertion sort algorithm as it sorts the following sequence of integer array into an ascending order. 17 3 12
Most questions answered within 3 hours.
-
A local
electronic company primarily manufactures four highly technical
telecommunication products. Each product must be processed...
asked 32 minutes ago -
•Describe the basic structure of collagen monomers •Explain how
amino acid composition of collagen contributes to...
asked 2 hours ago -
Compute the sample correlation coefficient
r for each of the following data sets.
(Use 3 decimal...
asked 2 hours ago -
5a. What are the advantages and disadvantages of Proxy ARP?
b. What is the TTL field...
asked 2 hours ago -
An ice cube (density = 900[kg/m3]) with a side length of
2.54[cm] is held by a...
asked 4 hours ago -
would you say that leaders in the international context are born
or made? That is, can...
asked 4 hours ago -
Instructions
Read the Digital Trends article "Solid state drives are speedier
than hard disk drives. Are...
asked 4 hours ago -
A multiple-choice test consists of 29 questions with possible
answers of a, b, c, d. Estimate...
asked 4 hours ago -
Question 1: Ethanol is the active ingredient of alcoholic
beverages. It is also s a possible...
asked 4 hours ago -
In the process of a simple distillation, the substances in the
still head tube are in...
asked 4 hours ago -
In a normal distribution with mean 3 and standard deviation of
7, what are the upper...
asked 5 hours ago -
A big block stone with mass M explodes and splits in two pieces
with mass 0.40M...
asked 5 hours ago