算法基础题——数组

#include <stdio.h>

void quickSort(int src[], int start, int end){
	
	if(start >= end){
		return;
	}
 
	int i = start;
	int j = end;
	int value = src[i];
	int tmp = i;
	while(i < j){
		while(i < j && src[j] >= value){
			j--;
		}
		src[tmp] = src[j];
		tmp = j;

		while(i < j && src[i] <= value){
			i++;
		}
		src[tmp] = src[i];
		tmp = i;
	}
	src[i] = value;

	quickSort(src, start, i-1);
	quickSort(src, i+1, end);
	return;
}

int main(){

	int src[] = {34,45,21,18,4,9,25,90};
	quickSort(src, 0, 7);
	for(int i=0; i<8; i++){
		printf("%d\n", src[i]);
	}
 }

#include <stdio.h>

int * bubble(int src[], int n){

	if(n <=1){
		return src;
	}
	int i,j,tmp;
	for(i=0; i<n; i++){
		for(j=i+1; j<n; j++){
			if(src[j] < src[i]){
				tmp = src[j];
				src[j] = src[i];
				src[i] = tmp;
			}
		}
	}

	return src;
}

int main(){
	int src[8] = {3,11,8,10,7,23,5,7};
	bubble(src, 8);
	for(int i=0;i<8;i++){
		printf("%d\n", src[i] );
	}

}

#include <stdio.h>
#include <string.h>

int search(int src[], int len, int value){
	
	int start = 0;
	int end = len - 1;
	
	int mid;

	while(start <= end){
		mid = (start + end) >> 1 ;
		if(value == src[mid]){
			return mid;
		}else if(value > src[mid]){
			start = mid + 1;
		}else{
			end = mid - 1;
		}
	}
	
	return -1;
}

int main(){

	int src[] = {1,2,3,4,5,6,7};
	int res = search(src, 7, 7);
	printf("%d\n", res);
}

//mergeArray.cpp
#include <stdio.h>
int * mergeArray(int a[], int b[], int c[], int lenA, int lenB, int &lenC) {

	int i = 0;
	int j = 0;
	int m = 0;
	lenC = 0;
	while(i < lenA && j < lenB){
		if(a[i] < b[j]){
			c[m] = a[i];
			i++;
			m++;
			lenC++;
		}else if(a[i] > b[j]){
			c[m] = b[j];
			j++;
			m++;
			lenC++;
		}else{
			c[m] = a[i];
			i++;
			j++;
			m++;
			lenC++;
		}
	}

	if(i == lenA && j < lenB){
		while(j < lenB){
			c[m] = b[j];
			j++;
			m++;
			lenC++;
		}
		
	}else if(j == lenB && i < lenA){
		while(i < lenA){
			c[m] = a[i];
			i++;
			m++;
			lenC++;
		}
	}
	return c;

}

int main(){

	int a[5] = {2,3,7,8,11};
	int b[6] = {3,9,10,12,88,89};
	int c[11];
	int len = 0;
	mergeArray(a, b, c, 5, 6, len);
	for(int i=0; i<len; i++){
		printf("%d\n", c[i]);
	}
}