Answered: 01... "" Impl

Engineering

Data Structures and Algorithms

01... "" Impl

Related questions

Q: Write an algorithm for a divide-and-conquer algorithm for finding values of both the largest and…

A: Ans:) Divide and Conquer approach is used to breakdown a problem into smaller problems and then…

Q: plementation TwoSumFaster that uses a linear algorithm to count the pairs that sum to zero after the…

A: The TwoSum and ThreeSum problems are well-known computational challenges that often appear in…

Q: a. In the best-case scenario, what is the fewest possible comparisons needed to find a number using…

A: Given an array of 1000 integers , Lets see the best and worst case of Linear search

Q: Given an array, returns a new array consisting of the longest run of consecutive nondecreasing…

A: Array is a data structure that store values of same data type in a contiguous form In java syntax of…

Q: integers, and x is an integer in the array A, and l and r are indices l ≤ r between which the…

A: The given algorithm is a binary search algorithm. In binary search, the target value is compared…

Q: Below are a number of statements about linear and binary search.

A: Solution - In the given question, we have to identify the correct statements.

Q: Write the following variant of insertion sort. // The function gets an array of length n of ints, //…

A: Insertion sort with number of swaps is implemented in C language. To return the swap numbers array…

Q: Consider the problem of finding the distance between the two closest and y is computed as x - y.)…

A: Pseudocode is an artificial and informal language that helps programmers develop algorithms. Writing…

Q: Since the default implementation of contains() calls get(), the inner loop of FrequencyCounter if…

A: The contains() function does indeed call get(), and so the inner loop of FrequencyCounter is making…

Q: Perform an experimental analysis to test the hypothesis that Java's Array.sort method runs in O(n…

A: Let us take the best example of merge sort in this case to prove the average running time O(n log…

Q: Problem 5. Let A be an array of n integers, each of which comes from the domain [1,U]. Note that…

A: The question requires to compute, for each distinct integer, how many integers are, less than equal…

Q: Consider sorting n numbers stored in array A by first finding the smallest element of A and…

A: Let's understand step by step : Selection sort : 1. In selection sort the smallest element first…

Q: Write a Java program that: • Defines a string array with a length of 15. • Populates the array with…

A: Merge Sort:Divide the array into two halves.Recursively apply Merge Sort to each half.Merge the two…

Q: array k has m elements k[0],….,k[m-1], and the elements have disntict values.You are asked to design…

A: One possible parallel algorithm to find the 2nd largest element in the array k with m elements is as…

Question

01...

""
Implementation of the Misra-Gries algorithm.
Given a list of items and a value k, it returns the every item in the list
that appears at least n/k times, where n is the length of the array

By default, k is set to 2, solving the majority problem.

For the majority problem, this algorithm only guarantees that if there is
an element that appears more than n/2 times, it will be outputed. If there
is no such element, any arbitrary element is returned by the algorithm.
Therefore, we need to iterate through again at the end. But since we have filtred
out the suspects, the memory complexity is significantly lower than
it would be to create counter for every element in the list.

For example:
Input misras_gries([1,4,4,4,5,4,4])
Output {'4':5}
Input misras_gries([0,0,0,1,1,1,1])
Output {'1':4}
Input misras_gries([0,0,0,0,1,1,1,2,2],3)
Output {'0':4,'1':3}
Input misras_gries([0,0,0,1,1,1]
Output None
"""..

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1: Language specifications

VIEW

Step 2: Code:

VIEW

Solution

VIEW

Step by step

Solved in 3 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, data-structures-and-algorithms and related others by exploring similar questions and additional content below.

Similar questions

Please help me solve this problem
Quicksort is a powerful divide-and-conquer sorting algorithm that almost always runs in O(nlogn) time,though it can run in O(n^2) time for certain input arrays, depending on how we choose the pivot. For this question assume that the pivot isalwaysthe last (right-most) element of the input array.There are two main ways that we can code the PARTITION procedure: the Lomuto method and the Hoare method. Question: Clearly explain how the two partition methods work – the Lomuto method and the Hoare method, and how they are different. Finally apply both methods to partition the arrayA= [2, 8, 7, 1, 3, 5, 6, 4], using the pivot A[8] = 4.
An array is called a winner if it has two entries which together add up to a third entry, i.e. if A[i] + A[j] = A[k]for some i,j,k, where i≠j≠k. a)Write an algorithm (pseudocode preferred) to determine if a given array A is a winner. Your algorithm should not use any additional data structures. b)Analyze the running time of your algorithm using Big-O notation.
During each iteration of Quick Sort algorithm, the first element of array is selected as a pivot. The algorithm for Quick Sort is given below. Modify it in such a way that last element of array should be selected as a pivot at each iteration. Also explain the advantages.
Quicksort is a powerful divide-and-conquer sorting algorithm that can be described in just four lines ofpseudocode. The key to Quicksort is the PARTITION(A, p, r) procedure, which inputs elementsptorof array A,and chooses the final element x = A[r] as the pivot element. The output is an array where all elementsto the left ofxare less thanx, and all elements to the right of x are greater than x. In this question, we will use the Lomuto Partition Method from class and assume that the pivot isalwaysthe last (right-most) element of the input array. Question: Let A be an array withn= 2k−1 elements, where k is some positive integer. Determine a formula (in terms of n) for the minimum possible number of total comparisons required by Quicksort, as well as a formula for the maximum possible number of total comparisons required by Quicksort. Use your formulas to show that the running time of Quicksort is O(nlogn) in the best case and O(n2) in the worst case.
Coding in Python, we have the function to perform this task, V col_Hdeg whichinputs the adjacency matrix A of the graph and initializes the array vert_color s tohold vertex colors. It then calculates the degree of each vertex and stores it in thearray degrees.The while loop iterates until all vertices are colored and at each iteration, thevertex v with the highest degree is colored. The array temp is used to find the currentcolors of the neighbors of vertex v and an unused smallest color is determined aftersorting this array.
The algorithm below searches for the maximum in an input array A. Assume A is a random sequence containing n distinguishable real numbers, what is the probability for line #4 to be executed exactly once? (The phrase "random sequence" here means the n numbers can appear in any order with equal chance.) mymax(A, n) { 1: max = A[1]; 2: for i = 2:n 3: if A[i] > max 4: max = A[i); 5: end; 6: end; 7: return max; }
A majority element is an element that makes up more than half of the items inan array. Given a positive integers array, find the majority element. If there is no majority element,return -1. Do this in O(N) time and 0(1) space.Input: 1 2 5 9 5 9 5 5 5Output: 5
Let M(n) be the minimum number of comparisons needed to sort an array A with exactly n ele- ments. For example, M(1) = 0, M(2) = 1, and M(4) = 4. If n is an even number, clearly explain why M(n) = 2M(n/2) + n/2.