simple 9. 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 + 0 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 Make as many improvements as you can in this algorithmic solution to the problem. If you need to, you may change the algorithm altogether; if nos improve the implementation given. 10

simple 9. 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 + 0 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 Make as many improvements as you can in this algorithmic solution to the problem. If you need to, you may change the algorithm altogether; if nos improve the implementation given. 10

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter6: Arrays

Section: Chapter Questions

Problem 17RQ

See similar textbooks

Similar questions

IN JAVA Exploration: Test the sorting algorithms as follows. For input sizes n = 500, n = 1,000, n = 1,500, …, n = 10,000 [That’s 20 different values of n]. For each n, create an array I of size n. Fill the array with n random integers. Create a copy M of the array I. Pass the array I to your insertion sort and record the number of comparisons. Pass the array M to your mergesort and record the number of comparisons.
Write a Java program that• Define an integer array with length of 10.• Populate the array with random integer numbers.• Sort this array into non-decreasing order based on three sorting algorithms.o bubble sorto selection sorto insertion sort• Test these 3 sorting methods• Give a big-Oh characterization, in terms of n, of the running time of these three algorithms.• I mprove the bubble sort so that the time complexity of them are O(N) for the best case Write a Java program that• Define an integer array with length of 100.• Populate the array with random numbers in {1, 2, ..., 30}.• Count and output the frequency of each number occurred in the array.• Give a big-Oh characterization, in terms of n, of the running time of this algorithm.
please answer with a proper explanation and step by step solution Question: In computer science, a sorting algorithm is an algorithm that puts elements of a list into an order. Below is how the input array is represented ARRAY [] = [50, 11, 33, 21, 40, 50, 40, 40, 21]. Below is the expected output after sorting ARRAY [] = [11, 21, 21, 33, 40, 40, 40, 50, 50]. Write a Java program called SelectionSort that takes an input array [50, 11, 33, 21, 40, 50, 40, 40, 21] and generates an output array [11, 21, 21, 33, 40, 40, 40, 50, 50]. Test your program with different testcases and provide comments.
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 an efficient algorithm (to the best of your knowledge) for the following problem, briefly describe why it is a correct algorithm, and analyze the time complexity. If you cannot find any polynomial-time algorithm, then give a backtracking algorithm. Problem: Repeated Number Input: An array A[1...3n] of positive integers. Output: If any number in the array appears at least n times, then print such a number. Otherwise, print 'none'. Example: Input: A = [1,3,3,3,1,1]. Here 3n = 6 and n =2. Output: 3. Note that here 1 would also be a valid output. You just need to print one if there are many options. Example: Input: A = [4,3,5,7,9,1]. Here 3n = 6 and n =2. Output: 'none'
Write a Java program that• Define an integer array with length of 10.• Populate the array with random integer numbers.• Sort this array into non-decreasing order based on three sorting algorithms.o bubble sorto selection sorto insertion sort• Test these 3 sorting methods• Give a big-Oh characterization, in terms of n, of the running time of these three algorithms.• I mprove the bubble sort so that the time complexity of them are O(N) for the best case
Write a program in java for the below given problem statement: Given 2 sorted arrays (in increasing order), find a path through the intersection that produces themaximum sum and return the maximum sum. That is, we can switch from one array to another array only atcommon elements. If no intersection element is present, we need to take the sum of all elements from thearray with greater sum.Sample Input:61 5 10 15 20 2552 4 5 9 15Sample Output :81Explanation :We start from array 2 and take sum till 5 (sum = 11). Then we'll switch to array at element 10 and take till15. So sum = 36. Now, no elements are left in array after 15, so we'll continue in array 1. Hence the sum is81.
Euclid’s algorithm (or the Euclidean algorithm) is an algorithm that computes thegreatest common divisor, denoted by gcd, of two integers. Below are the original versions ofEuclid’s algorithm that uses repeated subtraction and another one that uses the remainder.int gcd_sub(int a, int b){ if (!a) return b; while (b) if (a > b) a = a – b; else b = b – a; return a;}int gcd_rem(int a, int b){ int t; while (b) { t = b; b = a % b; a = t; } return a;}1. Trace each of the above algorithm using specific values for a and b.2. Compare both algorithms.
1. Consider the algorithm for the sorting problem that sorts an array by counting,for each of its elements, the number of smaller elements and then uses thisinformation to put the element in its appropriate position in the sorted array:ALGORITHMComparisonCountingSort(A[0..n − 1])//Sorts an array by comparison counting//Input: Array A[0..n//Output: Array S[0..n− 1] of orderable values− 1] of A’s elements sorted// in nondecreasing orderfor i ← 0 to nCount− 1 do[i]←0for i ← 0 to n − 2 dofor j ← i +1 to n − 1 doif A[i] < A[j ]Count[j ]← Count[j ] + 1else Count[i]← Count[i] + 1for i ←0 to n−1 doS[Count[i]]←A[i]return Sa. Apply this algorithm to sorting the list 60, 35, 81, 98, 14, 47.b. Is this algorithm stable?c. Is it in-place?
Create an algorithm that demonstrates the Fibonacci search process. The number of data elements in this instance, n, is such that: I Fk+1 > (n+1); and (ii) Fk + m = (n +1) for some m 0, where Fk+1 and Fk are two consecutive Fibonacci numbers.
Given an unsorted array A of integers of any size, n ≥ 3, and an integer value x, write an algorithm as a pseudo code (not a program!) that would find out if there exist EXACTLY3 occurrences in the array with value x. What is the time complexity of your algorithm, in terms of Big-O? What is the space complexity of your algorithm, in terms of Big-O? What if , the given array A is sorted. Will time complexity change from the case that A was unsorted? • If yes; give a new algorithm that achieves this better complexity (indicate the time complexity as of that algorithm). • If no, explain why such new constraints/conditions cannot lead to a better time complexity.
Let A and B be two arrays of length n, each containing a random permutation of the numbers from 1 to n. An inversion between the two permutations A and B is a pair of values (x, y) where the index of x is less than the index of y in array A, but the index of x is more than the index of y in array B. Design an algorithm which counts the total number of inversions between A and B that runs in O(n log n) time.