Sorting list numerically in Cadence SKILL Language

procedure( list_sort(l_list,
	     @optional (my_mode 0), (rm_duplicate 0)
	   ); list_sort
prog( (k, ii, jj, n, p, my_value)
  n = length(l_list)

  declare(p[n])
  for(k, 0, n-1
    p[k] = nth(k, l_list)
  ); for

  for(ii, 0, n-2
    my_value = p[ii]
    k = ii
    for(jj, ii+1, n-1
    prog( ()
	if(my_mode == 0 then
	  when( my_value < p[jj], return() ) ; ascend
	else
	  when( my_value > p[jj], return() ) ; descend
	); if
	my_value = p[jj]
	k = jj
    ); prog
    ); for
    p[k] = p[ii]
    p[ii] = my_value
  ); for

  my_value = p[0]
  l_list = list(my_value)
  for(k, 1, n-1
    if(rm_duplicate != 0 then
	when(p[k] != my_value
	  my_value = p[k]
	  l_list = append1(l_list, my_value)
	); when
    else
	l_list = append1(l_list, p[i])
    ); if
  ); for
  return(l_list)
); prog
); procedure