02.Binary Search

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace binarySearch
{
    class Program
    {
        static void Main(string[] args)
        {
            int[] inputArray = Console.ReadLine().Split().Select(int.Parse).ToArray();
            int specialNumber = int.Parse(Console.ReadLine());

            LinearSearch(inputArray, specialNumber);
            bool swapped = false;

            do
            {
                swapped = false;
                for (int i = 0; i < inputArray.Length - 1; i++)
                {
                    if (inputArray[i] > inputArray[i + 1])
                    {
                        Swap(ref inputArray, ref inputArray[i], ref inputArray[i + 1]);
                        swapped = true;
                    }
                }
            } while (swapped);

            BinarySearch(inputArray, specialNumber);

        }

        static void LinearSearch(int[] arr, int number)
        {
            int iterations = 0;
            bool isNumberFound = true;
            for (int i = 0; i < arr.Length; i++)
            {
                if (arr[i] == number)
                {
                    iterations++;
                    Console.WriteLine("Yes");
                    isNumberFound = true;
                    break;
                }
                else if (arr.Length - 1 != number)
                {
                    isNumberFound = false;

                }
                iterations++;
            }
            if (!isNumberFound)
            {
                Console.WriteLine("No");
            }
            Console.WriteLine($"Linear search made {iterations} iterations");
        }

        static void BinarySearch(int[] arr, int number)
        {

            int iterations = 0;

            int low = 0;
            int mid;
            int high = arr.Length - 1;
            int mid1 = 0;
            for (int i = 0; i <arr.Length; i ++)
            {

                mid = low + (high - low) / 2;
                if(mid == mid1)
                {
                    iterations--;
                    break;
                }
                if (arr[mid] < number)
                {
                    low = mid + 1;

                    iterations++;
                }
                else if (arr[mid] > number)
                {
                    high = mid - 1;
                    iterations++;
                }
                else if (arr[mid] == number)
                {
                    iterations++;
                    break;
                }
                mid1 = mid;
            }

            Console.WriteLine($"Binary search made {iterations} iterations");
        }



        static void Swap(ref int[] arr, ref int num1, ref int num2)
        {
            int temporary = num1;
            num1 = num2;
            num2 = temporary;
        }
    }
}