Question

1. Let B be an array of size n >= 6 containing integers from 1 to...

1. Let B be an array of size n >= 6 containing integers from 1 to n – 5, inclusive, with exactly five repeated. Describe a good algorithm for finding the five integers in B that are repeated.
For example, let B = {1,2,3,2,1,2,3,3}. 2,1,2,3,3 would be the 5 repeated integers.

Java Language...
0 0
Add a comment Improve this question Transcribed image text
Answer #1

ANSWER :-

GIVEN THAT :-

import java.util.*;

public class Main{
//returns the repeted numbers in the list from position pos to end of array
public static void findRepeated(int[] B,int pos, boolean[] visited){
//base case
if(pos==B.length){
//print a new line and return
System.out.println();
return;
}
//if this element has not occured yet
//then make it visited
if(!visited[B[pos]-1]){
visited[B[pos]-1]=true;
}else{
//if it has been visited earlier then this is a repeated element
System.out.print(B[pos]+" ");
}
findRepeated(B, pos+1, visited);
}
public static void main(String[] args){
int B[] = new int[]{1,2,3,2,1,2,3,3};
boolean visited[] = new boolean[B.length];
// a boolean array to keep track of elements which have occured once
for(int i=0;i<visited.length;i++){
visited[i]=false;
}
findRepeated(B, 0, visited);
}
}

SCREEN SHOT :-

5 6 8 9 10 15 16 17 i import java.util.*; 2 3. public class Main{ 4 //returns the repeted numbers in the list from position p

OUTPUT :-

  21233

Add a comment
Know the answer?
Add Answer to:
1. Let B be an array of size n >= 6 containing integers from 1 to...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Let A = [A[1], A[2],…..,A[n]] be an array of n distinct integers. For 1 <= j...

    Let A = [A[1], A[2],…..,A[n]] be an array of n distinct integers. For 1 <= j <= n, the index j is a happy index if A[i] < A[j] for all 1 <= i < j. Describe an O(n)- time algorithm that finds all the happy indices in the array A. Partial credit will be given for an O(n log(n))-time algorithm and a minimal credit will be given for an O(n^2) –time algorithm. What is the running time of your...

  • Let A be an array containing n numbers (positive and negative). Develop a divide and conquer algo...

    need help in this algorithm question Let A be an array containing n numbers (positive and negative). Develop a divide and conquer algorithm that finds the two indices 1 sisjsn such that A[k] (the sum of the elements from i to j) is maximized. For example, in the array A [10,-5,-6,5, 7,-2,4, -11], the sub-array A[4:6] has the sum 5+ 7-2+4-14 and no other sub-array contains elements that sum to a value greater than 14, so for this input the...

  • (20 points) You are given an array A of distinct integers of size n. The sequence...

    (20 points) You are given an array A of distinct integers of size n. The sequence A[1], A[2], ..., A[n] is unimodal if for some index k between 1 and n the values increase up to position k and then decrease the reminder of the way until position n. (example 1, 4, 5, 7, 9, 10, 13, 14, 8, 6, 4, 3, 2 where the values increase until 14 and then decrease until 1). (a) Propose a recursive algorithm to...

  • Consider the following problem: Input: a list of n-1 integers and these integers are in the...

    Consider the following problem: Input: a list of n-1 integers and these integers are in the range of 1 to n. There are no duplicates in list. One of the integers from 1 to n is missing in the list. Output: find the missing integer Let the input array be [2, 4, 1, 6, 3, 7, 8]. Elements in this list are in the range of 1 to 8. There are no duplicates, and 5 is missing. Your algorithm needs...

  • 6. Let T(1..n] be a sorted array of distinct integers, some of which may be negative....

    6. Let T(1..n] be a sorted array of distinct integers, some of which may be negative. Give an algorithm that can find an index i such that 1 <i<n and T[i] = i, provided such an index exists. Your algorithm should take a time in O(lg n) in the worst case. Answers must be proven (or at least well justified)

  • 4 Let the set of all possible keys considered is the set of all integers from...

    4 Let the set of all possible keys considered is the set of all integers from 0 to 10,000 inclusive. Consider a closed hashing and a hash table of size M 10 and the hash function h(x) xmod 10. Note: Using a prime number as the size of the table is not a good idea. However, we do so to keep the calculations simple. a) Write an algorithm (using any programming language) to find the largest value in this hash...

  • Let S be a sequence of n distinct integers stored in an array as array elements...

    Let S be a sequence of n distinct integers stored in an array as array elements S[1], S[2], · · · , S[n]. Use the technique of dynamic programming to find the length of a longest ascending subsequence of entries in S. For example, if the entries of S are 11, 17, 5, 8, 6, 4, 7, 12, 3, then one longest ascending subsequence is 5, 6, 7, 12. Specifically: (a) define a proper function and find the recurrence for...

  • 6. Consider the following basic problem. You're given an array A consisting of n integers A[1],...

    6. Consider the following basic problem. You're given an array A consisting of n integers A[1], A[2], , Aln]. You'd like to output a two-dimensional n-by-n array B in which B[i, j] (for i <j) contains the sum of array entries Ali] through Aj]-that is, the sum A[i] Ai 1]+ .. +Alj]. (The value of array entry B[i. Λ is left unspecified whenever i >j, so it doesn't matter what is output for these values.) Here's a simple algorithm to...

  • Given as input an array A of n positive integers and another positive integer x, describe...

    Given as input an array A of n positive integers and another positive integer x, describe an O(nlogn)-time algorithm that determines whether or not there exist two elements Ai and AONn the array A such that is exactly x.

  • I need to create a Java program that, given an array of size N whose entries...

    I need to create a Java program that, given an array of size N whose entries are numbers between 0 and 10^6, finds the largest repeating subarray. Doesn't matter how many times the array is repeated. For example, an array [0 1 2 1 4 1 2 1 0 5] should return 3 for the subarray [1 2 1]. I need this to be quite time efficient. I was recomended Suffix array but no idea how to implement.

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT