Answer:
The method in Java is as follows:
public static int numUnique(int list[]) {
int unique = 1;
for (int i = 1; i < list.length; i++) {
int j = 0;
for (j = 0; j < i; j++) {
if (list[i] == list[j])
break;
}
if (i == j)
unique++;
}
return unique;
}
Explanation:
This line defines the numUnique method
public static int numUnique(int list[]) {
This initializes the number of unique elements to 1
int unique = 1;
This iterates through the list
for (int i = 1; i < list.length; i++) {
The following iteration checks for unique items
int j = 0;
<em> for (j = 0; j < i; j++) {
</em>
<em> if (list[i] == list[j]) </em><em>If current element is unique, break the iteration</em><em>
</em>
<em> break; </em>
<em> }
</em>
if (i == j)
unique++;
}
This returns the number of unique items in the list
return unique;
}
Answer:
d. Merge sort
Explanation:
Merge sort is example of an efficient sorting alogrithm. The Divide and conquer rule is used in this technique. This method breakdown the list into multiple sublists and each sublist contains a single element. This technique merged in the form of sorted lists. This technique uses external memory of the system while sorting.
Merge sort is used to sort the 10,000 items using only 1,000 slots available in the RAM.
Uh how do you get a little blue box in a sandwich
The answer is C ms-dos
Side note:
GUI means graphical user interface. In other words, that means it looks pretty and has cool buttons, animations and cute stuff. MS-DOS is just a black screen with words on it. Definitely not cute or cool.
lst = [12,10,32,3,66,17,42,99,20]
a)
for x in lst:
print(x)
b)
for x in lst:
print(str(x) + " " +str(x**2))
I think this is what you're looking for. Hope this helps!
