public int insert(int key){
		
		//that's a linear search
		int loc;
		for(loc=0;loc<len;loc++){
			if(key<array[loc])
				break;
		}
		
		int i;
		//here's an example of REVERSE TRAVERSING
		for(i=len-1;i>=loc;i--){
			array[i+1]=array[i];
		}
		array[loc]=key;
		len+=1;
		return key;
		
	}