超多打印的-二分法-理解（分为有序、无序两部分）--图纸验算版本

一次代码

#include <stdio.h>


void binaryInsert_sort(int *arr, int n) 
{
	//i遍历指针；j找到插入位，将插入位及其后面到达遍历位的数后移
	//get每次从后面无序中拿到的数据
	//left前面有序的首指针，mid前面有序的中间指针，right前面有序的末尾指针
	int i, j, get, left, mid, right;
	for (i = 1; i < n; i++) 
	{
		printf("i = %d\n", i);
		get = arr[i];                   //拿到要插入的值
		printf("get = %d\n", get);
		left = 0;						//left前面有序的首指针
		right = i - 1;					//right前面有序的末尾指针
		
		while (left <= right)			//前面有序部分的二分插入
		{
			printf("外层right = %d\n", right);

			mid = (left + right) >> 1;     //每次取中值比较
			printf("此时left=%d, right=%d,中值mid =(left + right) >> 1= %d\n",left, right, mid);
			if (arr[mid] < get)
			{
				printf(" arr[mid]=%d < get=%d\n", arr[mid], get);
				
				left = mid + 1;              //中值比插入数据小，中间值左移--说明该值在左边
				printf(" 里层left = %d\n", left);
				//puts("中间值左移");
			}
			else
			{
				printf(" arr[mid]=%d > get=%d\n", arr[mid], get);
				
				right = mid - 1;              //反之在右边--中间值右移
				printf(" 里层right = %d\n", right);
				//puts("中间值右移");
			}
		}


		for (j = i - 1; j >= left; j--)		//找到插入位，将元素后移，腾出空间
		{         
			arr[j + 1] = arr[j];
			
			printf(" j = %d\n", j);
			printf("arr[j+1] = %d\n", arr[j]);
		}
		arr[left] = get;                        //插入
		puts("循环结束后：");
		printf(" [此时的left] = %d\n", left);
		printf(" 插入位置的值arr[left] = %d\n", arr[left]);
		putchar('\n');

			//for (i = 0; i < n; i++)
			//{
			//	printf("循环一次的数组%d ", arr[i]);
			//}
			//printf("\n");
	}
	//int i;


}
void print(int *arr, int n)
{
	int i;
	for (i = 0; i < n; i++)
	{
		printf("%d ", arr[i]);
	}
	printf("\n");
}
int main(int argc, char const *argv[])
{
	int arr[6] = { 20, 30, 40, 10, 60, 50 };
	int n = sizeof(arr) / sizeof(int);
	binaryInsert_sort(arr, n);
	print(arr, n);
	return 0;
}

相关链接

https://blog.csdn.net/weixin_42826139/article/details/87891852?utm_medium=distribute.pc_relevant.none-task-blog-BlogCommendFromMachineLearnPai2-1.channel_param&depth_1-utm_source=distribute.pc_relevant.none-task-blog-BlogCommendFromMachineLearnPai2-1.channel_param

二次代码：添加了中间值左移、右移的打印

#include <stdio.h>


void binaryInsert_sort(int *arr, int n) 
{
	//i遍历指针；j找到插入位，将插入位及其后面到达遍历位的数后移
	//get每次从后面无序中拿到的数据
	//left前面有序的首指针，mid前面有序的中间指针，right前面有序的末尾指针
	int i, j, get, left, mid, right;
	for (i = 1; i < n; i++) 
	{
		printf("i = %d\n", i);
		get = arr[i];                   //拿到要插入的值
		printf("get = %d\n", get);
		left = 0;						//left前面有序的首指针
		right = i - 1;					//right前面有序的末尾指针
		
		while (left <= right)			//前面有序部分的二分插入
		{
			printf("外层right = %d\n", right);
			putchar('\n');

			mid = (left + right) >> 1;     //每次取中值比较
			printf("此时left=%d, right=%d,中值mid =(left + right) >> 1= %d\n",left, right, mid);
			if (arr[mid] < get)
			{
				printf(" arr[mid]=%d < get=%d\n", arr[mid], get);
				
				left = mid + 1;              //中值比插入数据小，中间值左移--说明该值在左边
				printf(" 里层left = %d\n", left);
				puts("中间值--左移");
				putchar('\n');
			}
			else
			{
				printf(" arr[mid]=%d > get=%d\n", arr[mid], get);
				
				right = mid - 1;              //反之在右边--中间值右移
				printf(" 里层right = %d\n", right);
				puts("中间值--右移");
				putchar('\n');
			}
		}


		for (j = i - 1; j >= left; j--)		//找到插入位，将元素后移，腾出空间
		{         
			arr[j + 1] = arr[j];
			
			printf(" j = %d\n", j);
			printf("arr[j+1] = %d\n", arr[j]);
		}
		arr[left] = get;                        //插入
		puts("循环结束后：");
		printf(" [此时的left] = %d\n", left);
		printf(" 插入位置的值arr[left] = %d\n", arr[left]);
		putchar('\n');
		printf("-------------------------------------------");
		putchar('\n');

	}
	


}
void print(int *arr, int n)
{
	int i;
	for (i = 0; i < n; i++)
	{
		printf("%d ", arr[i]);
	}
	printf("\n");
}

int main(int argc, char const *argv[])
{
	int arr[6] = { 20, 30, 40, 10, 60, 50 };
	int n = sizeof(arr) / sizeof(int);
	binaryInsert_sort(arr, n);
	print(arr, n);
	return 0;
}

三次代码：加深了对mid +1\mid - 1的理解

**加深了左、右边界的理解
以及对中间值mid的理解**

#include <stdio.h>


void binaryInsert_sort(int *arr, int n) 
{
	/*
		i遍历指针；j找到插入位，将插入位及其后面到达遍历位的数后移
		get每次从后面无序中拿到的数据
		left前面有序的首指针，mid前面有序的中间指针，right前面有序的末尾指针
	*/
	int i, j, get, left, mid, right;
	for (i = 1; i < n; i++) 
	{
		printf("i = %d\n", i);
		get = arr[i];                   //拿到要插入的值
		printf("get = %d\n", get);
		left = 0;						//left前面有序的首指针
		right = i - 1;					//right前面有序的末尾指针
		
		while (left <= right)			//前面有序部分的二分插入
		{
			printf("外层right = %d\n", right);
			putchar('\n');

			mid = (left + right) >> 1;     //每次取中值比较
			printf("此时left=%d, right=%d,中间值下标 mid =(left + right) >> 1= %d\n",left, right, mid);
			if (arr[mid] < get)
			{
				printf(" arr[mid]=%d < get=%d\n", arr[mid], get);
				/*
				 中值比插入数据小，中间值左移--说明该值在左边
				 中间值<小于> 插入值，那么将中间值下标设定为新的左边界
				 因为mid值已经被判断过了因此新的左边界位mid+1
				 */
				left = mid + 1;             
				printf(" 里层-新的左边界left = %d\n", left);
				puts("中间值右侧会插入get值--中间值会左侧移动");
				putchar('\n');
			}
			else
			{
				printf(" arr[mid]=%d > get=%d\n", arr[mid], get);
				/*
				 中值比插入数据大，中间值右移--说明该值在右边
				 中间值<大于> 插入值，那么将中间值下标设定为新的右边界
				 因为mid值已经被判断过了因此新的右边界位mid-1
				 */
				right = mid - 1;              
				printf(" 里层-右边界right = %d\n", right);
				puts("中间值左侧会插入get值，中间值会--右侧移动");
				putchar('\n');
			}
		}

		/*
		找到插入位，将元素后移，腾出空间
		将前一个值 赋值 给后一个值(例如： i+1 = i)
		*/
		for (j = i - 1; j >= left; j--)		
		{         
			arr[j + 1] = arr[j];
			
			printf(" j = %d\n", j);
			printf("arr[j+1] = %d\n", arr[j]);
		}
		arr[left] = get;                        //插入
		puts("循环结束后：");
		printf(" [此时的left] = %d\n", left);
		printf(" 插入位置的值arr[left] = %d\n", arr[left]);
		putchar('\n');
		printf("-------------------------------------------");
		putchar('\n');

	}
	


}
void print(int *arr, int n)
{
	int i;
	for (i = 0; i < n; i++)
	{
		printf("%d ", arr[i]);
	}
	printf("\n");
}

int main(int argc, char const *argv[])
{
	int arr[6] = { 20, 30, 40, 10, 60, 50 };
	int n = sizeof(arr) / sizeof(int);
	binaryInsert_sort(arr, n);
	print(arr, n);
	return 0;
}

i = 3时候的验算分析，就打印信息一起分析更佳