[ASK] Sort n Modus

#Coba misal ada array
num = [3,8,10,15,7]
ord[]
ord[0] = num [0]
#get the first minimum
for i = 0..num.size
  if ord[0] < num[i]
    ord[0] = num[i]
  end
end
# determine max
max = ord[0]
for i = 0..num.size
  if num[i] > max
    max = num[i]
  end
end
#all except ord[0] become max temporaryly
for i = 1..ord.size
  ord[i] = max
end

#to the next
for i = 1..num.size
  for j = 0..num.size
    #is current id value lower than or equal to max and not higher than previous id
    if ord[i] > num[j] and ord[i] <= ord[i-1]
      ord[i] = num[j]
    end
  end
end

# contoh....
ngaco = [5, 7, 9, 1, 3, 2]
# any largest number
parah = 999
for i in 0..ngaco.size
  for j in i..ngaco.size
    if ngaco[j] < parah
      parah = ngaco[j]
      ngaco[j] = ngaco[i]
      ngaco[i] = parah
    end
  end
end

ngaco = [5, 7, 9, 1, 3, 2]
for i in 0..ngaco.size
  for j in i + 1..ngaco.size
    if ngaco[j] < ngaco[i]
      parah = ngaco[j]
      ngaco[j] = ngaco[i]
      ngaco[i] = parah
    end
  end
end

for i in 1..ngaco.size
  if i == (i-1)
    walah += 1
  else
    if aduh > walah
      aduh = walah
      x = @ngaco[i]
    end
    walah = 0
  end
end

for i in 1..ngaco.size
  if @ngaco[i] == @ngaco[i - 1]
    walah += 1
  else
    if walah > aduh
      aduh = walah
      index_modus = i - 1
    end
    walah = 0
  end
end
bilangan_modus = ngaco[index_modus]
jumlah_kemunculan = aduh