3. Write a Java program that generates randomly a list of N integers, sorts the generated list using each of the two sorting algorithms: mergesort sort and quicksort and prints as output the number of comparisons as well as the execution time for each of the two algorithms for N= 10000, 20000, 40000, 80000, 160000. Present your results in a table of the form shown below and plot the results in two separate charts, one chart for the number of comparisons (for both algorithms in the same chart) and one chart for the execution time (for both algorithms in the same chart). N= 10,000 N= 20,000 N=40,000 N=80,000 N= 160,000 Comparisons for Mergesort Comparisons for Quicksort Time for Mergesort Time for Quicksort

3. Write a Java program that generates randomly a list of N integers, sorts the generated list using each of the two sorting algorithms: mergesort sort and quicksort and prints as output the number of comparisons as well as the execution time for each of the two algorithms for N= 10000, 20000, 40000, 80000, 160000. Present your results in a table of the form shown below and plot the results in two separate charts, one chart for the number of comparisons (for both algorithms in the same chart) and one chart for the execution time (for both algorithms in the same chart). N= 10,000 N= 20,000 N=40,000 N=80,000 N= 160,000 Comparisons for Mergesort Comparisons for Quicksort Time for Mergesort Time for Quicksort

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

We have to create a program in java in which the below mentioned things should be there- You have been given the head to a singly linked list of integers. Write a function check to whetherthe list given is a 'Palindrome' or not.Input Format:Elements of linked listOutput Format:True or FalseSample Input 1:9 3 2 2 3 9Sample Output 1:trueSample Input 2:0 2 3 2 5Sample Output 2:false
Write a program that reads a list of integers and outputs those integers in reverse. The input begins with an integer indicating the number of integers that follow. For coding simplicity, follow each output integer by a comma, including the last one. Assume that the list will always contain fewer than 20 integers. Ex: If the input is: 5 2 4 6 8 10 the output is: 10,8,6,4,2, To achieve the above, first read the integers into an array. Then output the array in reverse.
Write a program in Java to implement Quick sort algorithm to sort a given set of elements and determine the time required to sort the elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted and plot a graph of the time taken versus n. The elements can be read from keyboard, a file or can be generated using the random number generator.
Write a python program that has the following functionality:• Using a loop it creates a two-dimensional list with 3 elements, such that theseelements are empty lists. (i.e., [ [ ], [ ], [ ] ] ).• Using a nested loop your program should store three (3) random integers between 1and 25 (inclusive) in each of these empty lists. A sample list after this step shouldlook like this; [ [4, 17, 25], [7, 7, 16], [21, 17, 5] ]• Using another nested loop your program should multiply each integer stored in thatlist and print the result. For the sample list given above the result is 2379048000.
Write a java code that sorts a list of n items by dividing it into three sublistsof about n/3 items, sorting each sublist recursively and merging the threesorted sublists. Analyze your algorithm, and give the results under ordernotation.
a. Write a version of the sequential search algorithm that can be used to search a sorted list. (1, 2) b. Consider the following list: 2, 20, 38, 41, 49, 56, 62, 70, 88, 95, 100, 135, 145 Using a sequential search on ordered lists, that you designed in (a), how many comparisons are required to determine whether the following items are in the list? (Recall that comparisons mean item comparisons, not index comparisons.) (1, 2) 2 57 88 70 135 Write a program to test the function you designed. Note: Have the function,seqOrdSearch, return -1 if the item is not found in the list. (return the index of the item if found).
Write a java program to insert one element in a singly linked list before a given element. Your program will print the original list, request the user to put in an element to be inserted, and an element to indicate the location of the insertion, then print the final list after the insertion is done. If the element doesn't exist in the list, add the new element to the end of the list. No duplicate values are allowed to store in list. Once you done insertion operation (at least 10 element inserted) in your list, Draw a binary search tree and AVL tree ( show all rotations ) as per your inserted values . Use the following as your test cases to evaluate whether your program works correctly: If you have a linked list: 6à2à7. With user input 8 and 2. Your list should become 6à8à2à7: With user input 8 and -1. Your list should become 6à2à7à8: Let suppose your final linked list . 6à2à7à8à5à10à1à9à3
Write a program in java that reads student names surnames and four marks of every student. Then, your program will show top m students sorted in descending order according to the averages. Use heap sort. Input specificationThe first line of the input contains two integers (n and m) where n denotes the number of students and m denotes the number of top students to show in the output where 1 ≤ m ≤ n ≤ 600. Each of the following n lines will have: Name: At most 15 chars string containing only English letters. Surname: At most 15 chars string containing only English letters. Four Marks: 4 integer numbers between 0 and 100 Output specificationShow top m students' names surnames and averages (with 2 decimal places after the floating point).
Please code this question in Java according to the function attached in picture. Given two numbers represented by a linked list, where each node contains a single digit. The digits are stored in reverse order, such that the 1's digit is at the head of the list. Write a function that adds the two numbers and return the sum as linked list: Example : Input : (7-> 1 -> 6) + (5-> 9-> 2). That is 617 + 295 = 912 Output : 2-> 1 -> 9 Expected time complexity : O(m+n), where m and n are no. of nodes in first and second linked list respectively.
Write a program that reads a list of integers, and outputs those integers in reverse. The input begins with an integer indicating the number of integers that follow. For coding simplicity, follow each output integer by a space, including the last one. Assume that the list will always contain fewer than 20 integers. Ex: If the input is: 5 2 4 6 8 10 the output is: 10 8 6 4 2 To achieve the above, first read the integers into an array. Then output the array in reverse. import java.util.Scanner; public class LabProgram { public static void main(String[] args) { Scanner scnr = new Scanner(System.in); int[] userList = new int[20]; // List of numElement integers specified by the user int numElements; // Number of integers in user's list// Add more variables as needed numElements = scnr.nextInt(); // Input begins with number of integers that follow/* Type your code here. */}}
For this exercise, a list of non-negative numbers will be given, for which the following operation can be done: subtract 1 from two contiguous elements from the list. It must say whether after any number of operations the list can be converted to a list of zeros. EntryThe input will be a list of non-negative integers x_i such that 0 <= x_i <= 2000000000. ". DepartureIf the given list can be converted to a list of zeros with the operation defined above, print "YES", otherwise, print "NO". Examples Input Example 1 1 2Output Example 1 NOT Input Example 2 2 4 2Output Example 2 YES
Write a Python source code using recursion to merge two sorted lists into a merged list which is obviously a bigger list containing all elements from the two sorted lists. Comment on the computational complexity of this code. Please name your function "merge" that has two arguments (first list, second list) and return a list of int.