Cacher is the code snippet organizer for pro developers

#include <iostream>
#include <math.h>
#include <fstream>


#define sizeOfArray 5
void findSquareRoot(
	int minBoundary,
	int maxBoundary
)
{

	for (int i = 0; i < (maxBoundary - minBoundary); i++)
	{
		std::cout << sqrt(minBoundary + i)<< std::endl;
		std::cout << (minBoundary + i) *  sqrt(minBoundary + i) << std::endl;
	}
}


int main()
{

	int arr[sizeOfArray] = {0,2,5, 3,4  };
	int kNearest = 0;

	std::cout << "fklf" <<std::endl;
	for (int i = 0; i < sizeOfArray; i++)
	{
		if (i >= sizeOfArray)
		{
			std::cout << << std::endl;
			i = 0;
		}
		if (arr[i] + 1 == (arr[i + 1]))
		{
			std::cout <<"find a k nearest!!! " << std::endl;
			kNearest++;
		}
	}

	


	//findSquareRoot(10, 15);

	while(1)
	{
		
	}

	return 0;
}