Data structure Consider the algorithm below, which sorts a list of n elements by using a Priority Queue (thealgorithm does not actually sort the list; rather just displays the sorted contents of the list.)public static void sort(List ts) {PriorityQueue pq = new PriorityQueue();for (Integer t1 : ts)pq. insert(t1);while (!pq.empty()) {Integer t2 =pq. deleteMin();System.out.println(t2);}Assume n is the size of the input list, and assume that the printing out (displaying) of each of theelements takes a constant time, 0O (1). What is the worst-case time complexity of this algorithm interms of Big-O, if the Priority Queue is implemented using:i) An unsorted linked list.ii) A sorted array.iii) A binary search tree.iv) An AVL tree.> Important: Notice that we are not only interested in the answer; but also, and mostimportantly, on how did you come to that conclusion. You must provide the full details onhow your reached that decision.B.

If the above algorithm is implemented using the following is as given below: i. Unsorted linked…

Answered: Consider the algorithm below, which…

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

void listEmployees (void) { for (int i=0; i 10000. Make a guess about why the comparison function takes 2 struct Employee parameters (as opposed to struct Employee *) **
// MergeSortTest.java// Sorting an array with merge sort.import java.security.SecureRandom;import java.util.Arrays; public class MergeSortTest { // calls recursive sortArray method to begin merge sorting public static void mergeSort(int[] data) { sortArray(data, 0, data.length - 1); // sort entire array } // splits array, sorts subarrays and merges subarrays into sorted array private static void sortArray(int[] data, int low, int high) { // test base case; size of array equals 1 if ((high - low) >= 1) { // if not base case int middle1 = (low + high) / 2; // calculate middle of array int middle2 = middle1 + 1; // calculate next element over // split array in half; sort each half (recursive calls) sortArray(data, low, middle1); // first half of array sortArray(data, middle2, high); // second half of array // merge two sorted arrays after split calls…
public static void bubblesort(int[] list) { assert list != null : "failed precondition"; int temp; boolean changed = true; for(int i = 0; i < list.length && changed; i++) { changed = false; for(int j = 0; j < list.length - i - 1; j++) { assert (j > 0) && (j + 1 < list.length) : "loop counter j " + j + "is out of bounds."; if(list[j] > list[j+1]) { changed = true; temp =…
public static void bubblesort(int[] list) {assert list != null : "failed precondition"; int temp; boolean changed = true; for(int i = 0; i < list.length && changed; i++) { changed = false; for(int j = 0; j < list.length - i - 1; j++) { assert (j > 0) && (j + 1 < list.length) : "loop counter j " + j + "is out of bounds.";if(list[j] > list[j+1]) { changed = true; temp = list[j + 1]; list[j + 1] = list[j]; list[j] = temp;} } } assert isAscending( list ); } Question (Data Flow Graph & Testing): draw DFG from the code above find the all-def/c/p use paths. Generate test cases to test this function using JUnit! (to test all-def/c/p use path)
Directed Graph G=(V,E), where: v={1,2,3,4} E={{1,2},{2,4},{4,1},{2,3},{3,1},{4,3}}| Which of the following adjacency matrices represents digraph G? Select one: O a {{0,1,0,0},{0,0,11},{1,0,0,0},(1,0,1,0}} b. {{0,1,0,0),(1,0,11}, {1,0,0,0} {0,0,1,0}}| c. {{0,1,0,0},(0,0,1},10.0.1) (1,0,0,0}} d. {{0.10,1},(0.0,1L1).{1,0.10} (1,010}}
In Python: Write a recursive function named Multiply2 that multiples by 2 and prints each element in a given list. For example: mylist=[1,2,3,4] Multiply2(mylist) prints: 2 4 6 8 Note: the function takes only one parameter, which is the list on which the operation will be performed. It's ok if the list becomes empty after calling the function.
The implementation of a queue in an array, as given in this chapter, uses the variable count to determine whether the queue is empty or full. You can also use the variable count to return the number of elements in the queue. On the other hand, class linkedQueueType does not use such a variable to keep track of the number of elements in the queue. Redefine the class linkedQueueType by adding the variable count to keep track of the number of elements in the queue. Modify the definitions of the functions addQueue and deleteQueue as necessary. Add the function queueCount to return the number of elements in the queue. Also, write a program to test various operations of the class you defined.
In the Recursive Binary Search shown below, there are two base cases: Line 10: the search is exhausted without a finding a value that matches the key Line 16: the search finds a value that matches the key 1 public class RecursiveBinarySearch { 2 public static int binarySearch(int[] list, int key) { 3 int low = 0; 4 int high = list.length - 1; 5 return binarySearch(list, key, low, high); 6 } 7 8 private static int binarySearch(int[] list, int key, 9 int low, int high) { 10 if (low > high) // The list has been exhausted without a match 11 return -low - 1; 12 13 int mid = (low + high) / 2; 14 if (key < list[mid]) 15 return binarySearch(list, key, low, mid - 1); 16 else if (key == list[mid]) 17 return mid; 18 else 19 return binarySearch(list, key, mid + 1, high); 20 } 21 22 public static void main(String[] args) { 23 int[] list = {3, 5, 7, 8, 12, 17,…
Functional meaning for the development of sequential structure is O a. pseudocode Ob. flowchart C. stepping d. selection e. looping
void funi (int iist , int s) { int sum=0; for (int i = 0; i
Java program with implementation of list using array Using switch, the user should be able to: It can add an item It can print the list It can get the size of the list It can edit an item It can delete an item
// pre: list != null, list.length > 0 // post: return index of minimum element of array public static int findMin(int[] list) { assert list != null && list.length > 0 : "failed precondition"; int indexOfMin = 0; for(int i = 1; i < list.length; i++) { if(list[i] < list[indexOfMin]) { indexOfMin = i; } } return indexOfMin; } Question: draw DFG from the code above find the all-def/c/p use paths. Generate test cases to test this function using JUnit! (to test all-def/c/p use path)

SEE MORE QUESTIONS

Recommended textbooks for you

C++ Programming: From Problem Analysis to Program…

Computer Science

ISBN:

9781337102087

Author:

D. S. Malik

Publisher:

Cengage Learning