Exercise 3: (Time efficiency analysis and algorithm improvement) Consider the following algorithm for finding the distance between the two closest elements in an array of numbers. Algorithm MinDistance (A[0..n-1]) //Input: Array A[0..n-1] of numbers //Output: Minimum distance between two of its elements dmin x for i 0 to n - 1 do for j 0 to n - 1 do if i ‡ j and |A[i] – A[j]| < dmin dmin A[i] A[j]| return dmin - (a) How many comparisons does the above algorithm has? Answer: (b) Make as many improvements as you can in this algorithm to improve the time efficiency. If you need to, you can change the whole algorithm; if not, improve the implementation given. Then, explain why your algorithm is more efficient than the above algorithm.

Exercise 3: (Time efficiency analysis and algorithm improvement) Consider the following algorithm for finding the distance between the two closest elements in an array of numbers. Algorithm MinDistance (A[0..n-1]) //Input: Array A[0..n-1] of numbers //Output: Minimum distance between two of its elements dmin x for i 0 to n - 1 do for j 0 to n - 1 do if i ‡ j and |A[i] – A[j]| < dmin dmin A[i] A[j]| return dmin - (a) How many comparisons does the above algorithm has? Answer: (b) Make as many improvements as you can in this algorithm to improve the time efficiency. If you need to, you can change the whole algorithm; if not, improve the implementation given. Then, explain why your algorithm is more efficient than the above algorithm.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Q: Consider an array consisting of the following sequence: 1, 4, 9, 16, 25, 49, …, n Suppose a number in the sequence is missing. (a). Write the mathematical process to find the missing number, i.e. some equation. (b). What is the time complexity of finding the missing number in the sequence?
Design and analyze a decrease-conquer algorithm for the following problem: o input: an array A[lo.. hi] whose elements are unique, and a positive integer k; o output: the kth smallest value in the array. (in C++)
c) Using a counting method or otherwise, show that the number of array accesses of the 3-sum algorithm given below is in the order of -N. 6. int count = 0; for (int i = 0; i< N; i++) { for (int j = i+1; j< N; j++) { for (int k = j+1; k< N; k++) { if (a[i] + a[j] + a[k] == 0) { count++ ; } }
: In searching an element in an array, linear search can be used, even though simple to implement, but not efficient, with only O(n) time complexity. Assuming the array is already in sorted order, modify the search function below, using a better algorithm, so the average time complexity for the search function is O(log n). include <iostream> using namespace std; int search(int al), int s, int v) { 1/ Modify below codes. for (int i = 0; i <s; i++) { if (a[i] = v) return i; return -1; int main() { int intArray:10] = { 5, 7, 8, 9, 10, 12, 13, 15, 20, 34); // Search for element '12' in 10-elements integer array. cout << search(intArray, 10, 12); // '5' will be printed out. // Search for element '35' in 10-elements integer array. cout << search(intArray, 10, 35); // '-1' will be printed out. // Index '-l' means that the element is not found. return 0;
1. Write an algorithm that applies right shift on one dimensional array (trace your algorithm on example array A: [0, 9, 2, 10, 3] and show the result of your trace steps as a table). *Dont use extra array while solving this problem *Just write algorithm do not write program in any other programming language
Fun with Sorting :Given the following array of numbers:8 2 3 9 10 1 4 6 7 5Show what the array looks like after each iteration of the following sorting algorithms:1) Bubble2) Selection3) Insertion4) MergesortOnly show the array contents with each algorithm. You do not need to show function callinstances if recursion is used or write any code. Just show the array at key iterations of thealgorithm. You can use your own words to describe them as well for more detail (but do notwrite any code).
1. Estimate in terms of n, the worst case time complexity of each of the following pseudo-code snippets: a. ALGORITHM sum(n) sum -0 for i 0 to n do for j +0 to n*n do sum Esum + 1 return sum
1.""Implementation of the Misra-Gries algorithm.Given a list of items and a value k, it returns the every item in the listthat 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 isan element that appears more than n/2 times, it will be outputed. If thereis 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 filtredout the suspects, the memory complexity is significantly lower thanit 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""".expl.
Course: Data structure and algorithms: Topic: Algorithm Complexity: Please solve it o emergency basis: Question 2: Imagine that we want to keep track of friendships between n people. We can do this with an array of size nXn. Each row of the array represents the friends of an individual, with the columns indicating who has that individual as a friend. For example, if person j is a friend of person i, then we place a mark in column j of row i in the array. Likewise, we should also place a mark in column i of row j if we assume that friendship works both ways. What will be the space complexity of this problem.
please code in python def isEverywhere(nums, val): #complete the function We'll say thatt a value is "everywhere" in an array if for every pair of adjacent elements in the array, at least one of the pair is that value. Return true if the given value is everywhere in the array. Example: isEverywhere([1,2,1,3],1) -> trueisEverywhere([1,2,1,3],2) -> falseisEverywhere([1,2,1,3,4],1) -> false
can you please convert this python code into java? Python code is as shown below: # recursive function def row_puzzle_rec(row, pos, visited): # if the element at the current position is o we have reached our goal if row[pos] == o: possible = True else: # make a copy of the visited array visited = visited[:} # if the element at the current position has been already visited then it's a loop. # as then its not possible to reach the last element, set possible to False if visited[pos]: possible = False else: # set visitied for the element as True visited[pos] = True possible = False # if its possible to move left then recurse in the left direction if pos - rowlpos} > o and row_puzzle_rec(row, pos - row[pos], visited): # return immediately if the goal is reached return True # if its possible to move right then recurse in the right direction if pos + rowlpos} < len(row) and row_puzzle_rec(row, pos + row[pos], visited): # return immediately if the goal is reached. return True return possible…
1.Given an array arr[] and an integer K where K is smaller than size of array, the task is to find the Kth smallest element in the given array. It is given that all array elements are distinct. Note :- l and r denotes the starting and ending index of the array. Example 1: Input: N = 6 arr[] = 7 10 4 3 20 15 K = 3 Output : 7.