Answer:
vxxgxfufjdfhgffghgfghgffh
Answer:
Explanation:
The following code is written in Java and is a function/method that takes in an int array as a parameter. The type of array can be changed. The function then creates a counter and loops through each element in the array comparing each one, whenever one element is found to be a duplicate it increases the counter by 1 and moves on to the next element in the array. Finally, it prints out the number of duplicates.
public static int countDuplicate (int[] arr) {
int count = 0;
for(int i = 0; i < arr.length; i++) {
for(int j = i + 1; j < arr.length; j++) {
if(arr[i] == arr[j])
count++;
}
}
return count;
}
Ruby can take up movie design in flim television ' or theater production
Answer:
count = 0
for x in range(len(array)):
if count == Len(array) -1:
break
max = max(array[:-1 - count])
count += 1
if array.index(max) == -1:
break
else:
hold = array[-1]
array[-1] = max
array[array.index(max)] = hold
Explanation:
The python program is an implementation of a maxsort. The for loop iterates over the array, getting the maximum number for each reduced array and swaps it with the corresponding last items.
