



'''simple docstring'''



import math



def 	_A							( _lowerCAmelCase       ):



							"""simple docstring"""



							return math.sqrt(_lowerCAmelCase       ) * math.sqrt(_lowerCAmelCase       ) == num



def 	_A							( _lowerCAmelCase       ):



							"""simple docstring"""



							__lowercase													=0
							__lowercase													=n
							while left <= right:
														__lowercase													=(left + right) // 2
														if mid**2 == n:
																					return True
														elif mid**2 > n:
																					__lowercase													=mid - 1
														else:
																					__lowercase													=mid + 1
							return False


if __name__ == "__main__":
		import doctest

		doctest.testmod()





"""simple docstring"""

from collections import Counter

import numpy as np
from sklearn import datasets
from sklearn.model_selection import train_test_split

SCREAMING_SNAKE_CASE_            =    datasets.load_iris()

SCREAMING_SNAKE_CASE_            =    np.array(data['''data'''])
SCREAMING_SNAKE_CASE_            =    np.array(data['''target'''])
SCREAMING_SNAKE_CASE_            =    data['''target_names''']

SCREAMING_SNAKE_CASE_       ,    SCREAMING_SNAKE_CASE_       ,    SCREAMING_SNAKE_CASE_       ,    SCREAMING_SNAKE_CASE_            =    train_test_split(X, y)




def      lowercase__    (       lowerCAmelCase					:       Optional[int]			,					lowerCAmelCase					:       Any			)			->   Optional[Any]:






    """simple docstring"""




    return np.linalg.norm(np.array(lowerCAmelCase			) - np.array(lowerCAmelCase			)			)




def      lowercase__    (       lowerCAmelCase					:       str			,					lowerCAmelCase					:       Any			,					lowerCAmelCase					:       List[Any]			,					lowerCAmelCase					:       Tuple			,					lowerCAmelCase					:       Dict=5			)			->   str:






    """simple docstring"""




    UpperCAmelCase          =       zip(lowerCAmelCase			,					lowerCAmelCase			)
    # List of distances of all points from the point to be classified
    UpperCAmelCase          =       []
    for data_point in data:
        UpperCAmelCase          =       euclidean_distance(data_point[0]			,					lowerCAmelCase			)
        distances.append((distance, data_point[1])			)
    # Choosing 'k' points with the least distances.
    UpperCAmelCase          =       [i[1] for i in sorted(lowerCAmelCase			)[:k]]
    # Most commonly occurring class among them
    # is the class into which the point is classified
    UpperCAmelCase          =       Counter(lowerCAmelCase			).most_common(1			)[0][0]
    return classes[result]


if __name__ == "__main__":
   print(classifier(X_train, y_train, classes, [4.4, 3.1, 1.3, 1.4]))



