64 765
Assignments Done
99,3%
Successfully Done
In September 2018

# Answer to Question #34926 in AJAX | JavaScript | HTML | PHP for John

Question #34926
Write an algorithm that returns the index of the last occurrence of the value key in a sequence s1, …,sn. If key is not in the sequence, the algorithm returns 0. Example, if the sequence is 12 11 12 23 and key is 12, the algorithm returns 3.
Input: sequence "s" indexed from 1 to n; number of elements in the sequence "n"  Output: First occurrence of the largest element in the sequencefind_largest_element(s,n) {large = s_1 \\ initializes largeindex_large = 1 \\ initializes the index of largefor i = 2 to n \\ steps through the sequenceif (s_i > large) { \\ since this is >, it will not be called if valueequals largelarge = s_i index_large = i}return index_large}

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!