# time_test_sort.py3  simple sort n^2 time  double and int
# n=100 0.4 seconds  n=1000 4 seconds  n=10,000 43 seconds
from numpy import *
import time

# 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("time_test_sort.py3 running")
n = 100000
print("n=",n)
vec = array([(0.0) for i in range(n)])
for i in range(n) :
  vec[i] = double(n-i)
  if i < 20 :
    print("vec[",i,"]=",vec[i])

  # end if
  
# end i
#
start = time.time()
sort(vec)
fin = time.time()
print("ran ",(fin-start)," seconds")
print("Sorted list in ascending order");
#
for i in range(n) :
  if i < 20 :
    print("vec[",i,"]=",vec[i])

  # end if
  
# end i
print("time_test_sort.py3 finished")

# end time_test_sort.py3