fork download
copy 
  1. #include<stdio.h>
  2. int swap(int *,int *);
  3. int search(int , int *, int );
  4. void main()
  5. {
  6.  int n,i,j;
  7.  printf("enter num of elements");
  8.  scanf("%d",&n);
  9.  int arr1[n];
  10.  printf("enter elements");
  11.  for(i=0;i<n;i++)
  12.  {
  13.   scanf("%d",&arr1[i]);
  14.   }
  15.   for(i=0;i<n;i++)
  16.   {
  17.    printf("%d",arr1[i]);
  18.    }
  19.  
  20.  
  21.    for(j=0;j<n-1;j++)
  22.    {
  23.      for(i=0;i<n-1;i++)
  24. 	 {
  25. 	   if(arr1[i]>arr1[i+1])
  26. 		{
  27. 	   swap(&arr1[i],&arr1[i+1]);
  28. 		}
  29. 		}
  30. 	}
  31. 	printf("\n");
  32. 	for(i=0;i<n;i++)
  33. 	printf("%d",arr1[i]);
  34. 	int m;
  35. 	printf("\n enter a number to search");
  36. 	scanf("%d",&m);
  37. 	//search(m,arr1[n/2]);
  38. 	search(m,arr1,n/2);
  39. 	return ;
  40. 	}
  41.  
  42. 	int search(int a, int b[],int n)
  43. 	{
  44. 		if(a==b[n])
  45. 		{
  46. 			printf("num is present at %d position",n); //b+1 nai .. n/2
  47. 		}
  48. 		else if(a<b[n])    //jahan-jahan tune b use kiya uski jagah b[n/2] use hoga
  49. 		{
  50. 	 		n=n/2;				// b ki jagah n
  51. 	 		search(a,b,n);
  52. 		}
  53. 		else if(a>b)
  54. 		{
  55. 			n=3*n/2;            	// b ki jagah n
  56. 			search( a,b,n); 
  57. 		}
  58. 	return 0;
  59. 	}
  60.  
  61.  
  62. 	int swap(int *a, int *b)
  63. 	{
  64. 	int t;
  65. 	t=*a;
  66. 	*a=*b;
  67. 	*b=t;
  68. 	}
Success #stdin #stdout 0s 2116KB
comments (?)
stdin
copy 
5
1 2 3 4 5
5
stdout
copy 
enter num of elementsenter elements12345
12345
 enter a number to search
https://ideone.com/3TMAqB
language:
C (gcc 8.3)
created:
8 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!