//Selection sort function. Parameters are Starting index and Array to sort.
function selectionSort (in1:int, in2:Array):Array{
        //trace (in2[0]); //Here, in2[0] is what it should be
        if (in1 >= in2.length-1) {//exit function if the starting element is the last element of the array
                return in2;
        }
        //trace ("Begin: "+in1+" Length: "+(in2.length-1))
        var begin = in1; //set instance variables to avoid pass-by-reference issues
        var toSort:Array = in2;
        //trace (in2[0]+ " " +toSort[0])//Checks is in2 and toSort are equal like they should be; they are
        var smallestID:int;
        var smallest:int = 999999; //set smallest to really big. Smallest is the smallest element in the array
        var temp:int; //a temporary variable used during swapping
        for (var i = begin; i < toSort.length; i++);{ //finds smallest element in array
                //trace (toSort[i]) //at this point, toSort[i] is undefined. Don't know why. It has not been changed it at all yet.
               
                //Somehow, this statement NEVER evaluates to true
                if (smallest > toSort[i]){//check if currently tested element is smaller then smallest
                        smallest = toSort[i];//set smallest equal to current element
                        smallestID = i;
                        //trace (smallest);
                        //trace (1); //trace to find out if the block ever runs; it doesn't. Prolly because toSort[i] is undefined
                       
                }
        }
        //trace (smallestID);
        //These 3 lines swap the smallest element and the element at [begin]
       
        temp = toSort[begin]; //this part works
        toSort[begin] = smallest;
        toSort[smallestID] = temp;
        //return the partially sorted array into the function to sort the next element in the array.
        return selectionSort (begin + 1, toSort);
}

selectionSort (0, array);

;