some sort function snippets

sort_search.c

//easy way
void quicksort(int v[], int n)
{
     int i, last;
     
     if(n <= 1)  
          return;
     
     swap(v,0, rand()%n);
     last = 0;
     for(i =1; i< n; i++)
     {
          if(v[i] < v[0])
               swap(v,++last,i);
     }
     swap(v,0,last);
     quicksort(v,last);
     quicksort(v+last+1,n-last-1);
}

//branch search
 int brachsearch(const int arr[], int low, int high,int key)
{
     int mid = low + (high - low)/2;
     if(low > high)
          return -1;
     else
     {
          if(arr[mid] == key)
               return mid;
          else if (arr[mid] > key)
               branchsearch(arr,low, mid -1; key);
          else
               branchsearch(arr,mid+1,high,key);
     }
}