binSearch.h

#pragma once
#include "searchWay.h"
#include "general classes.h"
#include <iostream>
using namespace std;


int binSearch (int left, int right, Wall *ArrWall [4000], Coordinate key){
	int midd = 0;
	while (1){
		midd = (left + right) / 2; 

		if (key.x < ArrWall [midd] -> x || (key.x == ArrWall [midd] -> x && key.y < ArrWall [midd] -> y)) //ĺńëč čńęîěîĺ ěĺíüřĺ çíŕ÷ĺíč˙ â ˙÷ĺéęĺ
			right = midd - 1; //ńěĺůŕĺě ďđŕâóţ ăđŕíčöó ďîčńęŕ
		else if (key.x > ArrWall [midd] -> x || (key.x == ArrWall [midd] -> x && key.y > ArrWall [midd] -> y)) //ĺńëč čńęîěîĺ áîëüřĺ çíŕ÷ĺíč˙ â ˙÷ĺéęĺ
			left = midd + 1; //ńěĺůŕĺě ëĺâóţ ăđŕíčöó ďîčńęŕ
		else      
			return midd; //číŕ÷ĺ (çíŕ÷ĺíč˙ đŕâíű)

		if (left > right) //ĺńëč ăđŕíčöű ńîěęíóëčńü 
			return -1;
	}
}