선택정렬과 이진탐색 합친 소스입니다.
엘핀
질문 제목 : 선택정렬과 이진 탐색 합친 소스입니다. 선택정렬은 되는데 이진탐색시 결과가 이상하게 나오네요;;
어디서 잘못됬는지 알려주세욧 ~~ ㅠ질문 내용 :
#includestdio.h
#includemath.h
#define MAX_SIZE 101
#define SWAP(x,y,t) ((t) = (x), (x) = (y), (y) = (t))
#define COMPARE(x,y) (((x)(y)) ? -1 : ((x) == (y))? 0: 1)
void sort(int [],int); // selection sort
int binsearch(int list[], int searchnum, int left, int right); //binary search
void main(void)
{
int i,n, searchnum, bin_result;
int list[MAX_SIZE];
int left=0,right;
printf(Enter the number of numbers to generate : );
scanf(%d, &n); right = n; if( n 1 || n MAX_SIZE) {
fprintf(stderr, Improper value of n\n);
exit(1);
}
for ( i=0; i n; i++) { //ramdomly generate numbers
list[i] = rand() % 1000;
printf(%d ,list[i]);
}
sort(list,n);
printf(\n Sorted array:\n );
for (i=0; i n; i++) //print out sorted numbers
printf(%d , list[i]);
printf(\n); printf(input searchnum : );
scanf(%d, &searchnum);
bin_result = binsearch(list, searchnum, left, right); if(bin_result = -1)
printf(NOT EXIST!\n);
else
printf(EXIST);
}
void sort(int list[], int n)
{
int i, j, min, temp;
for (i=0; in-1; i++) {
min = i;
for (j= i+1; jn; j++)
if (list[j] list[min])
min = j;
SWAP(list[i], list[min], temp);
}
}int binsearch(int list[], int searchnum, int left, int right)
{
int middle; middle = (left + right) / 2;
while(left = right)
{
middle = (left = right)/2;
switch (COMPARE(list[middle], searchnum)) {
case -1: left =middle + 1;
break;
case 0 : return middle;
case 1 : right = middle -1;
}
}
return -1;
}
