Describe an algorithm that takes as input a list of n integers in nondecreasing order and produces the list of all values that occur more than once. (

Input a series of integer numbers and split the string from the input to get a list. Then check and convert each string to integer with a list comprehension. Create a new variable with a value equal to the set of the list ( to get unique values) then check for the occurrence of each value in the original list.

Explanation:

This algorithm is used to check for the occurrence of values in a list that has been sorted in ascending order. This is faster if the items in the list is not converted to integer yet (still strings) before writing a for loop to check the value count in the list.

i think so.

by: nicholas

answerstandard;