# Include <malloc. h>
# Include <stdio. h>
# Define N 11
/* Search by monitoring record */
Int search (int array [], int n, int k)
{Int I;
I = n-1;
Array [0] = k;
While (array [I]! = K) I --;
Return (I );
}
/* Half-lookup Method */
Int halfsearch (int array [], int n, int k)
{Int I, j, mid;
I = 1; j = n;
While (I <= j)
{Mid = (I + j)/2;
If (k = array [mid]) return (mid );
Else if (k <array [mid]) j = mid-1;
Else I = mid + 1;
}
Return (0 );
} /* Bubble sorting method */
Void mpsort (int array [])
{Int I, j,;
A = 0;
For (I = 1; I <N; I ++)
For (j = I + 1; j <N; j ++)
If (array [I]> array [j])
{A = array [I];
Array [I] = array [j];
Array [j] = ;}
}
/* Insert the sorting directly */
Void insertsort (int array [])
{Int I, j;
For (I = 2; I <N; I ++)
{Array [0] = array [I];
J = I-1;
While (array [0] <array [j])
{Array [j + 1] = array [j --];
Array [j + 1] = array [0];
}
}
}
/* Create */
Void creat (int array [])
{Int I;
Printf ("enter the array: n ");
For (I = 1; I <N; I ++)
Scanf ("% d", & array [I]);
} /* Display */
Void print (int array [])
{Int I;
Printf ("The numbers after sort is: n ");
For (I = 1; I <N; I ++)
Printf ("% d", array [I]);
Printf ("n ");
}
Main ()
{Int a [11], I, x, chang;
/* Printf ("enter the arrayn ");
For (I = 1; I <11; I ++)
Scanf ("% d", & a [I]); */
Aga:
Printf ("nchang: 1: use watching method findingn 2: use half method findingn 3: use directness intsert method sortn 4: use bubble up method sortn 5: exitn ");
Scanf ("% d", & chang );
Switch (chang)
{Case 1:
{Creat ();
Printf ("Please int the se |
