Write nonrecursive implementations of the min() and floor() methods in BST.java. Make sure to use only one return in your method.
Use an insertion sort (discussed in class) to sort an array (sequence) of long word integers. The size of the list will appear just before the list itself. Use the same labelsas in this example:
LENGTH: DC.W 6
SPOT: DC.L 66,5,30,-4,10,12
The program must work for lists of between 1 and 20 numbers at a minimum,and should really work for much longer lists.
Include comments.
It is normal to turn this kind of application into a subroutine. The subroutine might well have two parameters. The first would be a size, and
the second the location of the list of long word integers to be sorted. Thus: sort(int size, int *ai) might be a C prototype. So for the example
above the actual parameters would be 6, and the address symbolized by SPOT.
Consider this a two part assignment. The first part is to get the insertion sort to work. The second part is to create and test a subroutine which uses the code created in the first part. There will be separate due dates.