0

Cam any1 pls help me

You are given a sorted (either in the increasing or in the decreasing order) sequence of numbers, ending with a .1 You can ass that are at least two numbers before the ending 1 Let us call the sequence x0 x1 xn-1 You have to output the number of distinct elements in the sorted sequence Kindly do not use arrays in the code

11th Sep 2018, 9:55 AM
Nilutpol Kashyap
Nilutpol Kashyap - avatar
2 Answers
- 1
cam
11th Sep 2018, 2:31 PM
CalviŐ˛
CalviŐ˛ - avatar
0
can you please be more specific CalviŐ˛
11th Sep 2018, 2:39 PM
Nilutpol Kashyap
Nilutpol Kashyap - avatar