=============================== Java: Write an algorithm (pseudo-code) that takes an unsorted list of n integers and outputs a sorted list of all duplicate integers. There must be no duplicates in the output list, also the output list should be a sorted list. The algorithm must run in O(n) time. Show your analysis of the running time. Note: Assume that inputs are integer values from 0 to 255. (Hint: use the concept that being used in the separate chaining) Example: {5,4,10,2,4,10,5,3,1} Output: 4, 5, 10

Q: Prove that Mergesort has a runtime of O(n*lg(n)), where n is the length of the list to be sorted

A: Algorithm of merge sort Using the Divide and Conquer technique, we divide a problem into…

Q: 2. Write an iterative algorithm which takes an input a singly linked list and reverse it. Java code…

A: The question is to write the JAVA code for the given problem.

Q: Consider sets represented as lists (possibly with duplicates, not necessarily ordered). If each list…

A: The question is on finding time complexity of the list intersection.

Q: What is the time complexity of the following code?   public boolean isBalanced(String exp) { int…

A: The solution for the above given question is given below:

Q: Consider the first number, say m. See how many times this number is repeated consecu- tively. If it…

A: Task :- Write a python program to convert given list into a read aloud list of number.   Python…

Q: Consider the Bernoulli trial where a success is that a random permutation of a1, a2, . . . , an is…

A: The bogosort algorithm is seen as a Bernoulli trial where there is a given list of numbers. If a…

Q: Consider a (singly) linked list. Describe an algorithm to remove every second element from the list.…

A: PROGRAM STRUCTURE: Include the required header files. Create a class definition for making the…

Q: 24. Instead of reading in an entire list N,, N,, ... all at once, some algorithms (depending on the…

A: - We have to give pseudocode for the list value average problem.

Q: Q8. Consider the Stack ADT implemented using a Python list (called items) such that push() and pop()…

A: Given: To choose the correct option.

Q: The range of a finite non empty set of n real numbers S is defined as the difference between the…

A: Question. The range of a finite nonempty set of n real numbers S is defined as the difference…

Q: Show how the binary search algorithm searches for 25 in the sorted list below: 4 6 17 25 32 39 41 43…

A: In binary search algorithm you first need a sorted array. The above is sorted so we can perform…

Q: The algorithm SkipListSort is a sorting algorithm that begins by inserting a sequence of keys into a…

A: Given: The algorithm SkipListSort is a sorting algorithm that begins by inserting a sequence of…

Q: What would be the asymptotic time complexity to remove a node at the end of singly linked list, if…

A: Number of operations are fixed here so time complexity is O(n) if there are n nodes in the linked…

Q: 6. Which of the following statements are true and which are false ? Justify your answer with a short…

A: Answer: Our instruction is answer the first three part from the first part and . I have given…

Q: a) i. With your own understanding, explain the Mid-Square method of generating Pseudo–Random Numbers…

A: Mid-Square method of generating Pseudo–Random Numbers : This method was proposed by Van Neumann. In…

Q: Develop an algorithm that uses a stack and a queue to determine if a string is a strict palindrome,…

A: Language is one of the most widely used programming language which has been used to create different…

Q: The intersection of two sets contains the list of elements that are common to both, without…

A: Intersection: Let A and B the two arrays that store the sets of A and B respectively and C be the…

Q: mance on arrays of sizes n = 102, 103, 104, 105, and 106. For each of these sizes consider:…

A: Sоrting  Аlgоrithm SоrtingАlgоrithms  сlаss  demоnstrаtes  three  sоrting  аlgоrithms  merge  sоrt,…

Q: Describe an O(n) or better algorithm that takes the unsorted array of integers as an input and…

A: O(n) it is describe an algorithm whose performance will grow linearly and in direct proportion to…

Q: Design an experiment to compare different algorithms for the selection problem, i.e. finding k’th…

A: 1) // Sort elements by Insertion sort def insertionSort(arr):   for i in range(1, len(arr)):…

Q: Consider the QuickSelect. This algorithm solves the problem of finding k-th smallest value in a…

A: Quickselect is a selection algorithm to find the k-th smallest element in an unordered list. It is…

Q: Implement three sorting algorithms – mergesort, quicksort, and heapsort in the language of your…

A: The answer is given in the below step by step

Q: Tukey's ninther def tukeys_ninthers(items): Back in the day when computers were far slower and had…

A: Code Screenshot

Q: IN JAVA Exploration: Test the sorting algorithms as follows. For input sizes n = 500, n = 1,000, n =…

A:

Q: Tukey's ninther def tukeys_ninthers(items): Back in the day when computers were far slower and had…

A:

Q: Given an unsorted array of integers, A, its size n, and two numbers x and y both elements of A.…

A: Include header file <iostream> for input output operations. Define main method Define array…

Q: aximum of all sub-arrays of size k in O(nk) time complexity using a deque (double-ended queue). The…

A: Take an example of finding the maximum of all sub-arrays of size k in O(nk) time complexity using a…

Q: AssuAssume we want to analyze empirically 4 variants of the Quicksort algorithm by varying the…

A: the code for the given requirement is

Q: find the average-case time complexity for bogosort where we are ordering the list a1, a2, . . . ,…

A: Bogosort algorithm is a type of sorting algorithm where the given list of numbers is randomly…

Q: Write an algorithm (pseudo-code) that takes an unsorted list of n integers and outputs a sorted list…

A: ALGORITHM:- Array: arr[0...n-1] After this, create an count array: cont[0...n-1]. After this,…

Q: Given an array of positive and negative integers, write the main ideas of an algorithm to segregate…

A: I have provided C++ code for a given question in which I used merge sort type thing.

Q: Suppose we have a queue Q containing n elements and an element x, describe an algorithm that removes…

A: Actually, algorithm is a step by step process.

Q: IN JAVA Exploration: Test the sorting algorithms as follows. For input sizes n = 500, n = 1,000, n…

A: Solution :: Java code ::   package com.example.sorting; import java.util.Random; public class…

Q: Consider the following algorithm that uses a list of n elements (alist). What is the worst case…

A: IN the given algorithm is linear search algo:…

Q: design an algorithm to find all the common elements in two sorted lists of numbers. For example, for…

A:

Q: air of values in the list N that sum to the value SUM.   For example, if your list of values is 3,…

A: Design and implement an algorithm that gets as input a list of k integer values N1, N2,..., Nk as…

Q: We talked about the trade-off between using sequential search on an unsorted list as opposed to…

A: According to the information given:- We have to find the worst case searches before the second…

Q: Complete the following recursive code which checks whether a given array is heap ordered. private…

A: If a node is at index k, then its left child is at 2*k and its right child is at 2*k+1 So,  left=2*k…

Q: Consider the following algorithms. Each algorithm operates on a list containing n elements, where…

A: Below is the simplified answer to the above listed problem MCQ problem:

Q: 20. Consider an algorithm intending to store all prime numbers between 2 and 20 (inclusive) in a…

A: (a)  if is_prime(2*i): prime_list.append(2*i) i=i+1increment of i is being done inside the if…

Q: Consider the following algorithm that uses a sorted list of n elements (alist). What is the worst…

A: Given Algorithm   a. O(log n) b. O(n) c. O(n log n) d. O(2^n) e.…

Q: Using the best approaches as seen in class, what is the worst case runtime of searching in a binary…

A: Please refer below for your reference: BST worst case is O(n), so option 4) is correct:…

Q: Consider using the Binary Search Algorithm, shown above, to find if 75 belongs to the following…

A: Given array of elements 4   8   19   25   34    39   45   48   66  75   89   95 Element to be…

Q: Performing sequential search for an item that is not present in an unsorted list has Best-Case…

A: Since, we know that the item is not present. And also list is unsorted, the key value( the item…

Q: Suppose you compute min & max of the following list of numbers using the divide and conquer…

A: In divide and conquer algorithm, it contains mainly 3 steps, that are: Divide Conquer Combine In…

Q: Suppose the sorted singly linked list consist of 8 nodes. Write the algorithm to Insert a node in a…

A: A singly linked-list is type of linked list that is undirectional, that is it can be traversd in…