comparing strings

 #include <stdio.h>

#include<string.h>
int main(){

char st1[]= "Anchal";
char *st2="Anchal";
int val= strcmp(st1,st2);
printf("%d",val);
 return 0;
}

Comments

Post a Comment

Popular posts from this blog

comparing 2 dates using structures

#include <stdio.h> typedef struct date{ int day; int month; int year; }datestruct; void display(datestruct d1,datestruct d2) {     printf( "First date is:%d/%d/%d\n" ,d1.day,d1.month,d1.year);     printf( "Second date is:%d/%d/%d\n" ,d2.day,d2.month,d2.year); } int datecomp(datestruct date1, datestruct date2) {     if (date1.year>date2.year)     {         return 1 ;     }     if (date1.year<date2.year)     {         return - 1 ;     }     if (date1.month>date2.month)     {         return 1 ;     }     if (date1.month<date2.month)     {         return - 1 ;     }     if (date1.day>date2.day)     {         return 1 ;     }     if (date1.day<date2.day)     {   ...
Read more

free dynamic memory allocation

  #include <stdio.h> #include <stdlib.h> int main(){ //printf("The size of int in your computer is %d\n",sizeof(int)); // printf("The size of float in your computer is %d\n",sizeof(float)); // printf("The size of char in your computer is %d\n",sizeof(char)); int * ptr; int * ptr2; int n; printf( "Enter the size of array:\n" ); scanf( "%d" ,&n); ptr=( int *) malloc(n* sizeof ( int )); for ( int i= 0 ;i< 600 ;i++) {     ptr2=( int *) malloc( 60000 * sizeof ( int ));     printf( "Enter the value of element %d:\n" ,i+ 1 );     scanf( "%d" ,&ptr[i]);     free(ptr2); } for ( int i= 0 ;i< 600 ;i++) {     printf( "The value of element %d is:%d\n" ,i+ 1 ,ptr[i]);     }   return 0 ; }
Read more

prime number

  #include <stdio.h> int main () {     int i , n ;     printf ( "Enter a number to check: \n " );     scanf ( " %d " , & n );     for ( i = 2 ; i < n ; i ++)     {         if ( n % i != 0 )         {             printf ( "The number is a prime number \n " );             break ;         }         else         {             printf ( "The number is not a prime number \n " );             break ;         }     }     return 0 ; }
Read more