ProgrammingDuniya

  #include<stdio.h> int main () { int n , i , j , flag = 0 , arr [ 20 ]; printf ( "Enter size of array : \n" ); scanf ( "%d" ,& n ); printf ( "array element are =\n" ); for (i = 0;i<n;i++) { printf("\n arr[%d]= ",i); scanf("%d",&arr[i]); } for(i=0;i<n;i++) { for(j=i+1;j<n;j++) { if(arr[i]==arr[j]&&i!=j) { flag=1; printf("Duplicate number position are %d and %d",i,j); } } } if(flag==0) printf("no duplicate"); } Output: Enter size of array : 5 array element are =  arr[0]= 2  arr[1]= 3  arr[2]= 4  arr[3]= 3  arr[4]= 6 Duplicate number position are 1 and 3

 #include<stdio.h> int main () { int days ; float yrs ; printf ( "Enter your age =\n" ); scanf ( "%f" ,& yrs ); days = yrs * 365 ; printf ( "%d days you are old" , days ); } Output: Enter your age = 18 6570 days you are old

 #include<stdio.h> int main () { int i , n , pos , arr [ 10 ]; printf ( "Enter size of array =\n" ); scanf ( "%d" ,& n ); for ( i = 0 ; i < n ; i ++) { printf ( "\narr[%d]=", i ); scanf ( "%d" ,& arr [ i ]); } printf ( "\n Enter position want to delete =" ); scanf ( "%d" ,& pos ); for(i = pos ; i < n - 1 ; i ++) arr [ i ]= arr [ i + 1 ]; n --; printf ( "Array after deletion\n" ); for ( i = 0 ; i < n ; i ++) { printf ( "\narr[%d]=%d" , i , arr [ i ]); } } Output: Enter size of array = 4 arr[0]=3 arr[1]=4 arr[2]=2 arr[3]=1  Enter position want to delete =2 Array after deletion arr[0]=3 arr[1]=4 arr[2]=1

 #include<stdio.h> int main() { int i,n,arr[20]; printf("Enter the number of element in the arry \n"); scanf("%d",&n); for(i=0;i<n;i++) { printf("\n arr[%d]=",i); scanf("%d",&arr[i]); } } output: Enter the number of element in the arry 5  arr[0]=1  arr[1]=2  arr[2]=3  arr[3]=4  arr[4]=5

  #include<stdio.h> int main () { int num1 , num2 , num3 ; printf ( "Enter any three number :\t" ); scanf ( "%d\t%d\t%d" ,& num1 ,& num2 ,& num3 );   printf ( "\t Program to find greatest number among three number\n" );      if ( num1 > num2 )   {   if ( num1 > num3 )   {   printf ( "1st number is greater" );   }   else   {   printf ( "3rd number is greater" );   }   }   else if ( num2 > num1 )   {   if ( num2 > num3 )   {   printf ( "2nd number is greater" );   }   else   {   printf ( "3rd number is greater" );   }   } } output: Enter any three number :        12 22 33          Program to find greatest number among three number 3rd number is greater OR By using nested if in C: #include<stdio....

 #include<stdio.h> int main () { int n,i,arr [ 10 ] ,num,found = 0 ; printf ( "Enter size of array=\n" ); scanf ( "%d" ,&n ); printf ( "Enter array element\n" ); for ( i = 0 ; i < n ; i ++) { printf ( "\narr[%d]=" ,i ); scanf ( "%d", & arr [ i ]); } printf("which no want to find\n" ); scanf ( "%d" , & num ); for ( i = 0 ; i < n ; i ++) { if ( arr [ i ]== num ) { found = 1 ; printf ( "Enter element is found in the array" ); break ; } } if ( found == 0 ) printf( "Enter element is not found" ); } output (element not found) Enter size of array= 5 Enter array element arr[0]=3 arr[1]=5 arr[2]=4 arr[3]=7 arr[4]=3 which no want to find 8 Enter element is not found output: (entered element found) Enter size of array= 5 Enter array element arr[0]=5 arr[1]=6 arr[2]=7 arr[3]=3 arr[4]=4 which no want to find 4 Entered element i...

 #include<stdio.h> int main () { int key,i,n,a [ 100 ] ,temp ;          int j = 0 ; printf( "\t Insertion sort " ); printf ( "\nEnter array size : " ); scanf( "%d" , & n ); printf ( "\nEnter actual Element in array : " ); for ( i = 0 ; i < n ; i ++) { scanf( "\n%d" , & a [ i ]); } for ( i=0 ; i < n ; i ++) { key = a [ i ]; j = j - 1 ; while ( j >= 0 && a [ j ]> key ) { a [ j + i ]= a [ j ]; j = j - 1 ; } a [ j + 1 ]= key ; } printf ( "resultant array=" ); for ( i = 0 ; i < n ; i ++) { printf( "%d\t" ,a[i] ); } } output: Insertion sort Enter array size : 5 Enter actual Element in array : 2 5 4 3 6 resultant array=2       3      4       5       6

#include<stdio.h> int main() { int i,j,temp=0,n,a[20]; printf("Enter the array size=\n"); scanf("%d",&n); printf("\nEnter the array element:\n"); for(i=0;i<n;i++) scanf("%d",&a[i]); for(i=0;i<n;i++) { for(j=0;j<n-i;j++) { if(a[j]>a[j+1]) { temp=a[j]; a[j]=a[j+i]; a[j+1]=temp; } } } printf("sorted array:\n"); for(i=0;i<n;i++) printf("%d\t",a[i]); return 0; } output: Enter the array size= 5 Enter the array element: 4 5 9 8 7 sorted array: 4       5       7     8      9  

Binary search in C  #include<stdio.h> int main () { int n,i,arr [ 10 ], num,found = 0 ; printf ( "Enter size of array=\n" ); scanf ( "%d" ,&n); printf ( "Enter array element\n" ); for ( i =0;i<n;i++) { printf ( "\narr[%d]=" ,i); scanf ( "%d" ,& arr [ i ]); } printf ( "which no want to find\n" ); scanf ( "%d" , &num ); for ( i = 0 ; i < n ; i ++) { if ( arr [ i ]== num ) { found = 1 ; printf ( "Enter element is found in the array" ); break; } } if ( found ==0) printf ( "Enter element is not found" ); } output: Enter size of array= 5 Enter array element arr[0]=55 arr[1]=33 arr[2]=53 arr[3]=34 arr[4]=44 which no want to find 53 Enter element is found in the array