It took some time to review the sorting, record it, and use the power to consolidate it ~
Using system;
Class sort
{
Static void main ()
{
VaR arr = intiarray ();
Bubblesort (ARR );
Arr = intiarray ();
Insertsort (ARR );
Arr = intiarray ();
Simpleselectsort (ARR );
Arr = intiarray ();
Quciksort (ARR, 0, arr. Length-1 );
}
Public static int [] intiarray ()
{
Random ran = new random ();
Int [] arr = new int [10];
For (INT I = 0; I <10; I ++)
{
Arr [I] = ran. Next (1,100 );
}
Return arr;
}
Public static int [] bubblesort (INT [] ARR)
{
Int I, J;
For (I = 0, j = arr. length; I <j; I ++)
{
Bool flag = false;
For (int K = J-1; k> I; k --) // index must be good
{
If (ARR [k] <arr [k-1])
{
Int temp = arr [k-1];
Arr [k-1] = arr [k];
Arr [k] = temp;
Flag = true; // note that the flag must be changed here
}
}
If (! Flag)
{
Return arr;
}
}
Return arr;
}
Public static int [] insertsort (INT [] ARR)
{
For (INT I = 0, j = arr. length; I <J-1; I ++)
{
Int temp = arr [I + 1];
Int K = I;
While (k> = 0 & temp <arr [k])
{
Arr [k + 1] = arr [k];
K --;
}
Arr [k + 1] = temp;
}
Return arr;
}
Public static int [] simpleselectsort (INT [] ARR)
{
For (INT I = 0, j = arr. length; I <j; I ++)
{
Int T = I;
For (int K = I + 1; k <j; k ++)
{
If (ARR [T]> arr [k])
{
T = K; // the smallest subscript is stored in T.
}
}
Int temp = arr [I];
Arr [I] = arr [T];
Arr [T] = temp;
}
Return arr;
}
Public static int partition (INT [] array, int low, int high)
{
Int I = low;
Int J = high;
Int lower = array [low];
While (low {
While (low <High & array [High]> lower)
{
-- High;
}
Array [low] = array [High];
While (low <High & array [low] <low)
{
++ Low;
}
Array [High] = array [low];
}
Array [low] = ignore;
Return low;
}
Public static int [] quciksort (INT [] array, int low, int high)
{
If (low {
Int partition tkey = partition (array, low, high );
Quciksort (array, low, repeated tkey-1 );
Quciksort (array, effectkey + 1, high );
}
Return array;
}
}