C # common algorithms

/// <Summary> // 1 + 2 + 3 + .... + N Recursive Algorithms /// </Summary> /// <Param name = "I"> </param> /// <returns> </returns> Public static int process1 (int I) {// calculate 1 + 2 + 3 + 4 +... + 100 values: if (I = 0) return 1; if (I = 1) return 1; return process1 (I-2) + process1 (I-1 );} /// <summary> // 1 + 2 + 3 + .... + N non-recursive algorithms /// </Summary> /// <Param name = "I"> </param> /// <returns> </returns> Public static int process2 (int I) {// calculate 1 + 2 + 3 + 4 +... + 100 of values if (I = 0) return 0; return process2 (I-1) + I ;} /// <summary> // 1-2 + 3-4 + 5 -.... + N non-recursive algorithms /// </Summary> /// <Param name = "isum"> </param> /// <Param name = "itype"> </param> // <returns> </returns> Public static int process0 (INT isum, int itype) {int sum = 0; For (INT I = 1; I <= isum; I ++) {If (itype = 1) {if (I % 2! = 0) {sum + = I;} else {sum + = (-1) * I ;}} else {sum + = I ;}} return sum ;} /// <summary> /// sort by Bubble Method /// </Summary> /// <Param name = "arrlen"> </param> Public static void Order1 (ref int [] arrlen) {int temp; For (INT I = 0; I <arrlen. length; I ++) // sort by bubble (Int J = I + 1; j <arrlen. length; j ++) if (arrlen [I]> arrlen [J]) {temp = arrlen [I]; arrlen [I] = arrlen [J]; arrlen [J] = temp ;}} /// <summary> /// sort by Bubble Method /// </Summary> /// <Param name = "arrlen"> </param> Public static void order2 (ref int [] arrlen) {for (INT I = 0; I <arrlen. length-1; I ++) {for (Int J = 0; j <arrlen. length-1-I; j ++) {If (arrlen [J]> arrlen [J + 1]) {int temp = arrlen [J]; arrlen [J] = arrlen [J + 1]; arrlen [J + 1] = temp ;}}}} // half-fold search, binary algorithm // The array must follow a certain order // parameter: Maximum, minimum, target (parameter type: integer) public static int binarysearch (INT min, int Max, int num) {If (min = max) Return-1; int mid = (min + max)/2; if (a [Mid] = num) return mid; else if (a [Mid] <num) {return binarysearch (Mid + 1, Max, num);} else {return binarysearch (Min, mid-1, num) ;}/// binary search, binary algorithm // non-recursive algorithm public static int binarysearch_f (INT num) {int min = 0; int max = 9; int mid; while (Min <= max) {mid = (min + max)/2; if (a [Mid] = num) return mid; else if (a [Mid]> num) max = mid-1; else min = Mid + 1;} return-1 ;}
Int A [10] =}