排序.cpp

来自「离散数学经典的算法」· C++ 代码 · 共 20 行

#include  <stdio.h>
 void swap(int *p1,int *p2)
 {
	 int temp;
	 temp=*p1;
	 *p1=*p2;
	 *p2=temp;
 }
  void main()
 {
	 int a=0,b=0;
	 int *point_a,*point_b;
	 point_a=&a;
	 point_b=&b;
	 printf("Input a and b:");
	 scanf("%d %d",&a,&b);
	 if(a>b)
	 swap(point_a,point_b);
	 printf("%d %d\n",a,b);
 }