BiLTeC

void linear_search(int arr[],int key)
{
for(int i=0;i<10000;i++)
if(arr[i]==key)
{
cout<<"Linear Search:"<<endl;
cout<<"Number of searched: "<<key<<" is the "<<i<<" element of the
array.Number of comperison:"<<i+1<<endl;
break;
}
}

void binary_search(int arr[],int key)
{
int low=0,middle,high=10000,count=0;

bubblesort(arr,10000);
while (low<=high)
{
middle=(low+high)/2;
if(key==arr[middle])
{
cout<<"Binary Search:"<<endl;
cout<<"The number searched: "<<key<<" is the "<<middle<<" element of
array.Number of comparison: "<<count+1<<endl;
break;
}
else if(key<arr[middle])
{
high=middle-1;
count++;
}
else
{
low=middle+1;
count++;
}
}
}
void bubblesort(int arr[],int size)
{
int hold;
for(int pass=1;pass<size;pass++)
for(int i=0;i<size-1;i++)
if(arr[i]>arr[i+1])
{
hold=arr[i];
arr[i]=arr[i+1];
arr[i+1]=hold;
}
}

function sort( r : list ) : list;
var head, tail : array[1..M] of list;
i, j, h : integer;

begin
for i:=D downto 1 do begin
for j:=1 to M do head[j] := nil;
while r <> nil do begin
h := charac( i, r^.k );
if head[h]=nil then head[h] := r
else tail[h]^.next := r;
tail[h] := r;
r := r^.next;
end;
{*** Concatenate lists ***}
r := nil;
for j:=M downto 1 do
if head[j] <> nil then begin
tail[j]^.next := r;
r := head[j]
end
end;
sort := r
end;

function sort( var r : list; n : integer ) : list;
var temp : list;

begin
if r = nil then sort := nil
else if n>1 then
sort := merge( sort( r, n div 2 ),
sort( r, (n+1) div 2 ))
else begin
temp := r;
r := r^.next;
temp^.next := nil;
sort := temp
end
end;

procedure sort( var r : ArrayToSort; lo, up : integer );

     label     999;
     var  d, i, j : integer;
          tempr : ArrayEntry;
     begin
     d := up-lo+1;
     while d>1 do begin
          if d<5 then    d := 1
               else d := trunc( 0.45454*d );
          {*** Do linear insertion sort in steps size d ***}
          for i:=up-d downto lo do begin
               tempr := r[i];
               j := i+d;
               while j <= up do
                    if tempr.k > r[j].k then begin
                         r[j-d] := r[j];
                         j := j+d
                         end
                    else goto 999;  {*** break ***}
               999:
               r[j-d] := tempr
               end
          end
     end;

procedure sort( var r : ArrayToSort; lo, up : integer );

     var  i, j : integer;
          tempr : ArrayEntry;
          flag : boolean;
     begin
     for i:=up-1 downto lo do begin
          tempr := r[i];
          j := i+1;
          flag := true;
          while (j<=up) and flag do
               if tempr.k > r[j].k then begin
                    r[j-1] := r[j];
                    j := j+1
                    end
               else flag := false;
          r[j-1] := tempr
          end
     end;