Write an algorithm that finds the second-smallest element among a, b, and c. Assume that the values of a, b, and c are distinct

Question

Computers & Technology

Isaac Rodriguez

7 December, 07:41

Write an algorithm that finds the second-smallest element among a, b, and c. Assume that the values of a, b, and c are distinct

+4

Answers (1)

Know the Answer?

Jaslyn Kelly · Answer 1

Num = [a, b, c]

m=0

for number in num:

if number > 0:

m = number

num. remove (m)

for number in num:

if number > 0:

m = number

return number

efficiency-wise this is sh*t, but its a start!