// Introduction to Algorithms
// Template for ILinear.where_to_insert()
// do Linear.search() first.
// <put your name, login name & student number here>

class ILinear implements SearchingToInsert {

    public int where_to_insert (int[] array, int upto, int seek) {
 	int size = array.length;

	int position =    ;

	// precondition

	while (     ) {

	    // loop invariant

	    // body of the loop

	}

	// postcondition

	return    ;	
    }


    // ignore this
    public void choice(int c) {}
}