C # Direct Insert sort

An array of type int as an example

1 namespaceDirect Insert Sort2 {3     class Program4     {5 6         Private Static voidInsert (int[] arrayList)7         {8             BOOLIsinsert =false;9              for(inti =1; i < arraylist.length; i++)Ten             { One                 intValue =Arraylist[i]; A                  for(intj = I1; J >=0; j--) -                 { -                     if(Arraylist[j] >value) the                     { -Arraylist[j +1] =Arraylist[i]; -                     } -                     Else +                     { -                         //found a value smaller than I, +arraylist[j+1] =value; AIsinsert =true; at                          Break; -                          -                     } -                     if(Isinsert = =false) -                     { -arraylist[0] =value; in                     } -  to                 } +             } -  the         } *  $         Static voidMain (string[] args)Panax Notoginseng         { -             int[] data =New[] {5,Ten, +, +, -, -}; the Insert (data); +             foreach(varTempinchdata) A             { theConsole.WriteLine (temp+"  "); +             } - Console.readkey (); $         } $     } -}

C # Direct Insert sort