public static void Main()
int[] arr = Enumerable.Range(1,10000).ToArray();
var uArr = new int[]{ 1, 9, 10, 3, 8, 6, 4, 5, 2, 7};
foreach(var e in uArr) Console.Write($"{e}, ");
static void SelectionSort(int[] arr){
for(var i = 0; i < n; i++){
for(var j = i + 1; j <= n; j++){
if(arr[j] < arr[min]) min = j;
(arr[i], arr[min]) = (arr[min], arr[i]);
static void BubbleSort(int[] arr){
for(var i = 0; i < n; i++){
for(var j = i + 1; j <= n; j ++){
(arr[i], arr[j]) = (arr[j], arr[i]);
public static int InterpolSearch(int[] arr, int value)
var high = arr.Length - 1;
while (value >= arr[low] && value <= arr[high] && low <= high)
var mid = low + (high - low) / (arr[high] - arr[low]) * (value - arr[low]);
Console.WriteLine($"prob: {mid}");
if (arr[mid] == value) return mid;
if (value > mid) low = mid + 1;
static int BinarySearch(int[] arr, int search){
var high = arr.Length - 1;
int mid = (low + high) / 2;
Console.WriteLine($"Mid: {mid}");
if(midValue == search) return mid;