#!/bin/sh
### time_test -- Test sort_n with various buffer sizes.
#                From near-minimum to large enough for one-pass qsort.
rm time_test.out
touch time_test.out
tail -f time_test.out &
for i in 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41
do
  echo "sort_n 1000000 ${i}00000 <urands_w.txt >urands_w.time_test" >>time_test.out
  sort_n 1000000 ${i}00000 <urands_w.txt 2>>time_test.out >urands_w.tt
if cmp urands_w.tt urands_w.sorted; then
    echo "=== output correct ==="
 else
    echo "=== OUTPUT MISMATCH==="
 fi
echo " "
 done
echo "sort -n <urands_w.txt >urands_w.tt" >>time_test.out
time sort -n <urands_w.txt >urands_w.tt 2>>time_test.out 
if cmp urands_w.tt urands_w.sorted; then
    echo "=== output matches ==="
 else
    echo "=== OUTPUT MISMATCH==="
 fi
echo "=== fin ===" >>time_test.out
kill %1