fork download

//quicksort with lomuto partition
 
void qs(int a[], int l, int r){
	if(l < r){
		int i = l - 1, x = a[r];
		for(int j = l ; j < r; j++){
			if(a[j] < x){
				++i;
				swap(a[i], a[j]);
			}
		}
		++i;
		swap(a[i], a[r]);
		qs(a, l, i - 1);
		qs(a, i + 1, r);
	}
}
 
//quicksort with hoare partition, pivot is the last element of segment
void qs2(int a[], int l, int r){
	int i = l, j = r, x = a[r];
	while(i <= j){
		while(a[i] < x) ++i;
		while(a[j] > x) --j;
		if(i <= j){
			swap(a[i], a[j]);
			++i; --j;
		}
	}
	if(i < r) qs2(a, i, r);
	if(l < j) qs2(a, l, j);
}
 

prog.cpp: In function ‘void qs(int*, int, int)’:
prog.cpp:9:5: error: ‘swap’ was not declared in this scope
     swap(a[i], a[j]);
     ^~~~
prog.cpp:13:3: error: ‘swap’ was not declared in this scope
   swap(a[i], a[r]);
   ^~~~
prog.cpp: In function ‘void qs2(int*, int, int)’:
prog.cpp:26:4: error: ‘swap’ was not declared in this scope
    swap(a[i], a[j]);
    ^~~~

Standard output is empty