Please provide explanation. Suppose you are given a sorted list of N elements followed by f(N)...
Please provide explanation.
Suppose you are given a sorted list of N elements followed by f(N) randomly ordered values.
How would you sort the entire list if:
(a) f(N) = N/20
(b) f(N) = O(log N)
(c) f(N) = O( √ N)
Homework Answers
Add Answer to:
Please provide explanation.
Suppose you are given a sorted list of N elements followed by
f(N)...
Let us suppose that there are n elements in the un-sorted array. Answer the following? q1:...
Let us suppose that there are n elements in the un-sorted array. Answer the following? q1: How is merge sort different from quick sort? q2: What is the split ratio in merge sort? q3: What is the worst-case/average-case/best-case running time of Merge Sort? q4: Why is the worst case running time of Merge sort O(n log n) always? q5: Why does Merge Sort use a static tree in the recursion process? (It is worth noting that the Quick Sort use...
Discrete Mathematics Unsorted and Sorted Lists For linear search there was no requirement for the list...
Discrete Mathematics
Unsorted and Sorted Lists For linear search there was no requirement for the list to be organized in any manner. The linear search works for lists that are "unsorted." But what if the values in the list are given in ascending order? This would be a sorted list. With a sorted list, is there a more efficient way to find the target? Unsorted Lists (4 pts) Assume there is a sorting algorithm with order of growth O(n), where...
Suppose you are given k sorted arrays of size n. Give an algorithm, that runs in...
Suppose you are given k sorted arrays of size n. Give an algorithm, that runs in O(nk log k)time, that merges them into a single list.
Please answer by mathematical language: An array of n elements is almost sorted if and only...
Please answer by mathematical language: An array of n elements is almost sorted if and only if every element is at most k spots away from its actual location. Assuming that you can only perform pairwise comparisons, formally prove that any algorithm which can sort almost sorted arrays must have running time Ω(n log k), You may assume that n is a multiple of k.
3. Suppose you have an array of n random elements. You are required to perform n...
3. Suppose you have an array of n random elements. You are required to perform n different searches on the array. What is best big-oh time for your entire task? Explain how to achieve that time. 4. Suppose you are given two sorted integer arrays int[] A and int[] B. Write a method that returns an array which contains only the common elements (elements that are present in both A and B) of these two sorted arrays. Indicate the big-Oh...
C++ Suppose that L is a list is of length n and it is sorted using...
C++ Suppose that L is a list is of length n and it is sorted using insertion sort. If L is already sorted in the reverse order, show that the number of comparisons is (1/2)(n2 – n) and the number of item assignments is (1/2)(n2 +3n) – 2.
You will be given an array of N elements sorted small to large. For the X...
You will be given an array of N elements sorted small to large. For the X and Y values that satisfy the X ≤ Y condition, draw the flow diagram of the algorithm that finds the start and end addresses of the region with the numbers greater than X and less than Y with the divide and manage approach and with O (logN) complexity. Also code the algorithm in c language. (not c++) Example: A[0…8] array 3, 5, 7, 9,...
Please provide solution/methods so I can understand how this work. Given a algorithm with f(n) 5n2...
Please provide solution/methods so I can understand how this
work.
Given a algorithm with f(n) 5n2 + 4n + 14 in the worst case, f(n) 3n2 + 17 log, n + 1in the average case, and f(n) in 17 the best case. Which of the following would be the tightest possible asymptotic descriptions of the algorithm? The following statement that would be tightest possible asymptotic description of the algorithm above A) O(n) B) o (n) C) (n?) D) On Log...
Date: December 12th, 2019 4. Describe why you selected the worstcase runtime above. Recall what we...
Date: December 12th, 2019 4. Describe why you selected the worstcase runtime above. Recall what we said about inversions and how the number of inversions is equivalent to the number of swaps for insertion sort. Also, recall the visualization from the notes on insertion First Name: Last Name: Hint: Given a list L = {4, 15, 104, Z. 11.2.14) where we are determining the number of inversions for 10, the inversions are underlined in red. I. INSERTION SORT 1. Given...
Please show clear explanation for both parts explain how you would use merge sort for (a)...
Please show clear explanation for both parts explain how you
would use merge sort for (a) and divide and conquer for (b).
Order Statistic. Given two sorted lists x and y. Both x and y
have size n.
(a) Describe an algorithm that finds the median of X
Y in O(n) time.
(b) Describe an algorithm that finds the median of X
Y in O(logn) time.
Discrete Mathematics
Unsorted and Sorted Lists For linear search there was no requirement for the list to be organized in any manner. The linear search works for lists that are "unsorted." But what if the values in the list are given in ascending order? This would be a sorted list. With a sorted list, is there a more efficient way to find the target? Unsorted Lists (4 pts) Assume there is a sorting algorithm with order of growth O(n), where...
Please provide solution/methods so I can understand how this
work.
Given a algorithm with f(n) 5n2 + 4n + 14 in the worst case, f(n) 3n2 + 17 log, n + 1in the average case, and f(n) in 17 the best case. Which of the following would be the tightest possible asymptotic descriptions of the algorithm? The following statement that would be tightest possible asymptotic description of the algorithm above A) O(n) B) o (n) C) (n?) D) On Log...
Date: December 12th, 2019 4. Describe why you selected the worstcase runtime above. Recall what we said about inversions and how the number of inversions is equivalent to the number of swaps for insertion sort. Also, recall the visualization from the notes on insertion First Name: Last Name: Hint: Given a list L = {4, 15, 104, Z. 11.2.14) where we are determining the number of inversions for 10, the inversions are underlined in red. I. INSERTION SORT 1. Given...
Please show clear explanation for both parts explain how you
would use merge sort for (a) and divide and conquer for (b).
Order Statistic. Given two sorted lists x and y. Both x and y
have size n.
(a) Describe an algorithm that finds the median of X
Y in O(n) time.
(b) Describe an algorithm that finds the median of X
Y in O(logn) time.
Most questions answered within 3 hours.
-
A university administrator working in student housing wants to
determine if the percentage of students residing...
asked 8 minutes ago -
3). Describe human population growth that has occurred in the
past 400 years. Use terms learned...
asked 5 minutes ago -
A
projectile is blue at a target. The distance from the point of
impact to the...
asked 29 minutes ago -
Given a 32 bit processor, with 2 MB of physical RAM split into 512
frames. What...
asked 20 minutes ago -
What were the main rulings in the Supreme Court cases which are
Morgan v. Virginia (1946)...
asked 19 minutes ago -
write a five paragraph essay on how setting,
specifically culture, influences the actions of
the characters...
asked 11 minutes ago -
JAVA
Provide a simple code sample of Merge sort
asked 21 minutes ago -
Discounting cash flows involves:
A. taking the cash discount offered on a trade merchandise
B. estimating...
asked 29 minutes ago -
A solid wood door 1.00 m wide and 2.00 m high is hinged along
one side...
asked 29 minutes ago -
Raleigh Company manufactures two joint products. At the
split-off point, they have sales values of:
Product...
asked 28 minutes ago -
1. Your grandmother has invested $4000 in a mutual fund each
year on your birthday (she...
asked 30 minutes ago -
HELP WITH SAS
Run the following DATA step to create a SAS data set called
ABC_CORP....
asked 43 minutes ago