#include <string.h>
#include "sortlin.h"

// quick sort !!!
void qqsort( char *v[], int left, int right )
{
	int i, last;
	if(left >= right) return;
  	swap( v, left, (left+right)/2);
  	last = left;
  	for(i = left + 1; i <= right; i++)
      	if( strcmp(v[i], v[left]) < 0)     // poredjenje !
	  			swap(v, ++last, i);
  	swap( v, left, last);
  	qqsort( v, left, last-1);
  	qqsort( v, last+1, right);
}

void swap(char *v[], int i, int j)
{  char *temp;
   temp = v[i];
   v[i] = v[j];
   v[j] = temp;
}