# test_sort.py3  simple sort n^2 time  double and int
from numpy import *

# sort
def sort(vec) :
  n = len(vec)
  print("sort n=",n)
  for i in range(n-1) :
    k = i
    for j in range(i+1,n) :
      if vec[j] < vec[k] :
        k = j

      # end if
      if k != i :
        t = vec[i]
        vec[i] = vec[k]
        vec[k] = t

      # end if

    # end j

  # end i

# end sort

print("test_sort.py3 running")
n = 10
vec = array([(0.0) for i in range(n)])
for i in range(n) :
  vec[i] = double(n-i)

# end i
print("vec=",vec)
veci = array([(0) for i in range(n)])
for i in range(n) :
  veci[i] = n-i

# end i
print("veci=",veci)
sort(vec)
print("Sorted list in ascending order");
print("vec=",vec)
sort(veci)
print("Sorted list in ascending order");
print("veci=",veci)
print("test_sort.py3 finished")

# end test_sort.py3