binary search algorithm

最新推荐文章于 2023-06-03 09:44:23 发布

潜行狙击

最新推荐文章于 2023-06-03 09:44:23 发布

阅读量1.3k

点赞数

CC 4.0 BY-SA版权

分类专栏： c 文章标签： search algorithm generator function compiler random

本文链接：https://blog.youkuaiyun.com/fanwenbo/article/details/7935899

c 专栏收录该内容

10 篇文章

订阅专栏

本文介绍了一种经典的二分查找算法实现方式，并通过一个简单的 C 语言程序进行了演示。该程序能够生成一定范围内的随机数，并在一个有序数组中查找这些数值，展示了二分查找的基本流程与效率。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

/*
 * =====================================================================================
 *
 *       Filename:  test.c
 *
 *    Description: Binary Search Algorithm 
 *
 *        Version:  1.0
 *        Created:  
 *       Revision:  none
 *       Compiler:  gcc
 *
 *         Author:   
 *   Organization:  
 *
 * =====================================================================================
 */

#include	<stdlib.h>

/* 
 * ===  FUNCTION  ======================================================================
 *         Name:  main
 *  Description:  
 * =====================================================================================
 */
//
#include <stdio.h>
#include <time.h>
#include <limits.h>
int
binary_search (int array[], int length, int n )
{
	int position;
	int mid;
	int left=0, right = length;

	mid = (left + right)/2;
	position = INT_MAX;
	while ( left <= right) {

			if ( array[mid] > n) {
				right = mid-1;
			}
			else if(array[mid] < n)
			{
				left = mid+1;
			}
			else if(array[mid] == n)
			{
				position = mid;
				break;
			}else{
			}
			mid = (left + right)/2;
//			printf ( "%d %d %d %d\n",left,right,mid, n);
	}
	return position;
}		/* -----  end of function binary_search  ----- */
/* 
 * ===  FUNCTION  ======================================================================
 *         Name:  randomnumbergenerator
 *  Description:  
 * =====================================================================================
 */
int
random_number_generator (int min, int max)
{
	int n=0;
	if(min > max)
{
	printf ( "range error. Max: %d, Mix: %d\n", max, min );
	return 0;
}
	n = rand()%(max-min+1)+min;
	return n;
}		/* -----  end of function randomnumbergenerator  ----- */
int
main ( int argc, char *argv[] )
{
	int n;
	int array[10];
	int i;	
	int ret;
	srand(time(NULL));
	for (i=0; i<sizeof(array)/sizeof(int); ++i ) {
		array[i] = i;
	}
	srand(time(NULL));
	for(i=0; i<10000; ++i)
	{
	n = random_number_generator(-10,10);
	{
	ret = binary_search(array, sizeof(array)/sizeof(int),n);
	if(ret == n)
	printf ( "find %d\n", n);
	else
	printf ( "can't find %d\n", n);
}
	}
	return EXIT_SUCCESS;
}				/* ----------  end of function main  ---------- */