Q1. Write an algorithm to do the following operation on an array passed as parameter: If...

Q1. Write an algorithm to do the following operation on an array passed as parameter: If an element of the array is having more than one occurrence, then keep the first occurrence and remove all other occurrences of the element.

Solutions

Expert Solution

Please find the answer below.

There can be two types of array

1) Sorted array : { 1, 2, 3 , 4, 5, 5 }

2) Unsorted array : { 1, 4, 5, 2, 6, 4 }

1) Algorithm to remove duplicate elements in a sorted array:

Input the number of elements of the array (n).
Input the array (arr) elements.
Pass the array (arr) and the size of the array (n) into the function as parameters.
Function :
- Loop i = 0 to n-1
  - if (arr[i] != arr[i+1])
  - temp[j++] = arr[i]
  - temp[j++] = arr[n-1]
- Loop i = 0 to j-1
  - arr[i] = temp[i]
- return j
Loop i= 0 to j-1
- Print : arr[i]

2) Algorithm to remove duplicate elements in an unsorted array :

Input the number of elements of the array (n).
Input the array elements (arr).
Pass the array (arr) and the size of the array (n) into the function as parameters.
Function :
- Create a hashmap and store all the elements and their count.
- Print all the elements from the hashmap having count = 1.

venereology answered 1 year ago

Next > < Previous

Related Solutions

Write a method which is passed A[], which is an array of int, and an int...

Write a method which is passed A[], which is an array of int, and an int passingScore. The method returns the number of items in A[] which are greater than or equal to passingScore. Write a method which is passed an array of int A[]. The method returns true if A[] is the same backwards and forwards. Write a method same( ), which is passed two arrays of int. The method returns true if the two arrays contain exactly the...

In Java: Write a method called copy, which is passed A[], which is an array of...

In Java: Write a method called copy, which is passed A[], which is an array of int, and an integer n. The method returns a new array consisting of the first n items in A[]. Write a method called slice, which is passed A[], which is an array of int, an integer i and an integer j. The method returns a new array consisting of all of the items in A from A[i] to A[j] inclusive.

[15 marks] (GetPositiveNumbers.java) Write a method that receives an array of integers as a parameter. The...

[15 marks] (GetPositiveNumbers.java) Write a method that receives an array of integers as a parameter. The method finds and returns an array which contains the positive numbers. For example, if the method receives an array with the following elements: 0 3 -1 2 5 1 -5 2 -2 0 the method should return an array with the following elements: 3 2 5 1 2 In the main method, randomly generate an array of 10 random integers between -5 and 5,...

C++ Write a function called linearSearch that takes an array as a parameter and search for...

C++ Write a function called linearSearch that takes an array as a parameter and search for a specific value inside this parameter. The function returns the frequency of a specific value in the array. In the main function: 1. Define an array called salaries of length 5. 2. Initialize the array by asking the user to input the values of its elements. 3. Define a variable called key and ask the user to enter a value for this variable. 4....

Write a method that takes an integer array as its parameter and sorts the contents of...

Write a method that takes an integer array as its parameter and sorts the contents of the array in ascending order using the Insertion Sort algorithm. Call this method after the original array and other stats have been displayed. Once the array has been sorted by your method, display its contents to the screen in the same manner as the original array was displayed. CODE SO FAR: import java.util.*; public class ArrayInteger { public static void getRandomNumber(int A[],int n){ Random...

c++ please 1. Write and test the function maximum that is passed an array of n...

c++ please 1. Write and test the function maximum that is passed an array of n pointers to integers and returns the maximum value among the n integers. The function must use the travellingpointer(1stversion) notation to traverse the array. The function has the following prototype. int maximum ( int *p [ ], int n); 2. Implement the function psum( )that is passed an array of n floats and returns a pointer to the sum of such an array. Print the...

(a) Implement the following algorithm, which is given a duplicate-free array array as input, in C++....

(a) Implement the following algorithm, which is given a duplicate-free array array as input, in C++. whatDoIDo (array): 1) Build a heap from array (using buildHeap as explained in class), where the heap starts at position array[0]. 2) Starting from j = size of array - 1, as long as j>0: i. Swap the entries array[0] and array[j]. ii. Percolate down array[0], but only within the subarray array[0..j-1]. iii. Decrement j by 1. Provide three input/output examples for duplicate-free arrays...

Let A be an array of non-decreasing N integers. Write an algorithm that returns the number...

Let A be an array of non-decreasing N integers. Write an algorithm that returns the number of pairs of integers in A that are equal. Analyze your algorithm thoroughly. Your analysis should include a thorough examination of both the best and the worst-case scenarios. This includes a description of what the best and worst cases would look like. You should include both space and time in your analysis, but keep in mind that space refers to “extra space,” meaning in...

Write a function, hexDigits that when passed an int array of any length greater than 0...

Write a function, hexDigits that when passed an int array of any length greater than 0 will print the corresponding hex digit for each int, one per line. The corresponding hex digit should be determined using a switch statement. The hex digits must be printed in uppercase and in order starting with the first entry. Each line of output should start with the array index of the number being written out, followed by a space, then the number, then another...

Consider the following algorithm to find the kth largest elementof a given array A of...

Consider the following algorithm to find the kth largest element of a given array A of n numbers. We pick every fifth element of A and place them in the array B. We find the median of B recursively, and use this median of B as a pivot to partition the array A. Depending on k and the number of elements that are smaller than the chosen pivot, we recurse into an appropriate subproblem of A.Answer the following questions.Write the...

Subjects