Académique Documents
Professionnel Documents
Culture Documents
PJESA E PARE }
A[i+1]=k;
min=i; if(A[j]<A[j-1]){
if(A[j]<A[min]) A[j]=A[j-1];
min=j; A[j-1]=tmp;
int i=j-1;
merge_sort(A,mes+1,fund);
while((i>0)&&(A[i]>k)){
merge(A,fillim,mes,fund);
A[i+1]=A[i];
}}
PS:qe te renditet e gjithe tabela A l=l+1;
duhet te therrite merge_sort(A,0,n-1) ku n
eshte nr i el te tab A. m=m+1;
while(k<=mes){ swap(&S[i],&S[pozpivot]);
A[m]=B[k]; pozpivot++;
k=k+1; }}
m=m+1; swap(&S[p],&S[pozpivot]);
} return (pozpivot);
while(l<=fundi){ }
A[m]=B[l];
6.BINARY SEARCH-alg i shpejte per te if(A[mes]>element)
kerkuar 1 el ne nje liste te renditur
return
int kerkim_binar(list A,int element,int (kerkim_binar(A,element,fill,mes-1));
fill,int fund){
else
int mes;
return
if(fill>fund) return -1; (kerkim_binar(A,element,mes+1,fund));
mes=(fill+fund)/2; }
if(A[mes]==element) return
mes;