import os
from os.path import join

filename = input("What is the name of the file?")
what_to_find = input("what do you want to find in the data?")

def findfile(file):
    data = []
    for root, dirs, files in os.walk('C:\Users\324086370'):
        print ("searching...")
        if file in files:
            with open(join(root, file),"r") as k:
                data = k.read()
                data = data.split("\n")
            return(data)

def bubbleSort(arr):
  isSorted = False
  while not(isSorted):
    for i in range(len(arr) - 1):
        for j in range(len(arr) - 1 - i):
            if arr[j] > arr[j+1]:
                arr[j], arr[j+1] = arr[j+1],arr[j]
            else:
              isSorted = True
  return (arr)

def selectionSort(arr):
  for i in range(len(arr)):
    minpos = 0
    for j in range(i,len(arr)):
      if arr[j] < arr[minpos]:
        minpos = j
    temp = arr[i]
    arr[i],arr[minpos] = arr[minpos],temp
  arr.append(arr[0])
  arr.pop(0)
  return (arr)

def insertionSort(arr):
  for i in range(len(arr)):
    element = arr[i]
    pos = i
    while (pos > 0 and arr[pos-1] > element):
      arr[pos] = arr[pos-1]
      pos = pos - 1
    arr[pos] = element
  return (arr)

def binarySearch(arr,target):
  low = 0
  high = len(arr)
  while low <= high:
    mid = (low + high) // 2
    if target == arr[mid]:
      return (True,mid)
    elif target < arr[mid]:
      high = mid - 1
    elif target > arr[mid]:
      low = mid + 1
  return (False,None)

data = findfile(filename)

didfind,position= binarySearch(insertionSort(data),what_to_find)

print("BubbleSort:",bubbleSort(data))
print("SelectionSort:",selectionSort(data))
print("InsertionSort",insertionSort(data))
print("BinarySearch: Found",what_to_find,"in position ",position+1)