Posts

Print pattern in c - number pattern -5

Image
Print pattern in c - number pattern -5 Write a program to print following pattern 1 12 123 1234 12345 Program code #include <stdio.h> int main() { int i, j; for(i=1;i<=5;i++) { for(j=1;j<=i;j++) { printf("%d",j); } printf("\n"); } return 0; } Step by Step solution 1. Number of row -    Is has 5row  , so first loop will execute for 5 time #include <stdio.h> int main() {     int i, j;     for(i=1;i<=5;i++)     {...... }     return 0; } 2. Number of character -  It has only one type of character , so there will be only one nested loop #include <stdio.h> int main() { ...... for(j=1;j<=i;j++) { printf("%d",j); } printf("\n"); } 3.Number of column - It has 5 maximum column and is decreasing with row number , so the nested loop decrease it's repetation with increase in row

Print pattern in c - number pattern -4

Image
Print pattern in c - number pattern -4 Write a program to print following pattern 54321 5432 543 54 5 Program code #include <stdio.h> int main() { int i, j; for(i=1;i<=5;i++) { for(j=5;j>=i;j--) { printf("%d",j); } printf("\n"); } return 0; } Step by Step solution 1. Number of row -    Is has 5row  , so first loop will execute for 5 time #include <stdio.h> int main() {     int i, j;     for(i=1;i<=5;i++)     {...... }     return 0; } 2. Number of character -  It has only one type of character , so there will be only one nested loop #include <stdio.h> int main() { ...... for(j=5;j>=i;j--) { printf("%d",j); } printf("\n"); return 0; } 3.Number of column - It has 6 maximum column and is decreasing with row number , so the nested loop decrease it's repetation with

Print pattern in c - number pattern -3

Image
Print pattern in c - number pattern -3 Write a program to print following pattern 54321 4321 321 21 1 Program code #include <stdio.h> int main() { int i, j; for(i=5;i>=1;i--) { for(j=i;j>=1;j--) { printf("%d",j); } printf("\n"); } return 0; } Step by Step solution 1. Number of row -    Is has 5row  , so first loop will execute for 5 time #include <stdio.h> int main() {     int i, j;     for(i=5;i>=1;i--)     {...... }     return 0; } 2. Number of character -  It has only one type of character , so there will be only one nested loop #include <stdio.h> int main() { ...... for(j=i;j>=1;j--) { printf("%d",j); } printf("\n"); } 3.Number of column - It has 5 maximum column and is decreasing with row number , so the nested loop decrease it's repetation with increase in row #include <stdio.h>

Print pattern in c - number pattern -2

Print pattern in c - number pattern -2 Write a program to print following pattern 12345 2345 345 45 5 Program code #include <stdio.h> int main() {     int i, j;     for(i=1;i<=5;i++)     {         for(j=i;j<=5;j++)         {             printf("%d",j);         }         printf("\n");     }     return 0; } Step by Step solution 1. Number of row -    Is has 5row  , so first loop will execute for 5 time #include <stdio.h> int main() {     int i, j;     for(i=1;i>=5;i++)     {...... }     return 0; } 2. Number of character -  It has only one type of character , so there will be only one nested loop #include <stdio.h> int main() { ...... for(j=i;j<=5;j++)         {             printf("%d",j);         }         printf("\n"); return 0; } 3.Number of column - It has 6 maximum column and is decreasing with row number , so the nested loop decrease it's repetation with increase

print pattern in c - number pattern -1

Print pattern in c - number pattern -1 Write a program to print following pattern 123456 12345 1234 123 12 1 Program code #include <stdio.h> int main() {     int i, j; for(i=6;i>=1;i--) {         for(j=1;j<=i;j++)         {             printf("%d",j);         }         printf("\n");     }     return 0; } Step by Step solution 1. Number of row -    Is has 6 row  , so first loop will execute for 6 time #include <stdio.h> int main() {     int i, j;     for(i=6;i>=1;i--)     {...... }     return 0; } 2. Number of character -  It has only one type of character , so there will be only one nested loop #include <stdio.h> int main() { ...... for(j=1;j<=i;j++)         {             printf("%d",j);         } return 0; } 3.Number of column - It has 6 maximum column and is decreasing with row number , so the nested loop decrease it's repetation with increase in row #include <std

Check prime number using recursive function

Check prime number using recursive function Write a program to Check prime number using recursive function #include <stdio.h> #include <conio.h> int n , e ,i ; int prime ( int n , int i) { if (n == 1 || n == 0 ) { return 2; } else { if (i == 1 ) return 0; else { if (n%i != 0){ prime(n , i-1); } else { return 1 ; } } } } int main () { printf("Input a number to check whether number is prime or not: "); scanf("%d" ,&n); e = prime ( n , n-1); if (e == 0 ) printf("\nThe supplied number is prime"); if (e == 1 ) printf("\nThe supplied number is not prime"); if (e == 2 ) printf("\nThe supplied number is neither prime nor not prime"); getch() ; return 0 ; } You can Browse related article below for more information and program code related to recursive function call  Does above is helpful , Post you views in comment DO NOT MISS OTHER C PROGRAMMING TUTORIAL * indicates requi

Sort character of string in ascending or descending order

Sort character of string in ascending or descending order Write a program to sort set of strings in ascending and descending order of their ... char Ascending #include <stdio.h> #include <conio.h> #include <string.h> int main () {     int n , i ,j ;     char name[100] , temp;     scanf("%s", name);     n = strlen(name);     for (i=0 ; i<n ; i++)     {         for(j=i+1 ; j<n ;j++)         {             if(name[i] > name[j])             {             temp = name[i]    ;             name[i] = name[j] ;             name[j] = temp;             }         }     } printf("\n%s" , name); getch() ; return 0 ;    } Descending #include <stdio.h> #include <conio.h> #include <string.h> int main () {     int n , i ,j ;     char name[100] , temp;     scanf("%s", name);     n = strlen(name);     for (i=0 ; i<n ; i++)     {         for(j=i+1 ; j<n ;j++)         {             if(name[i] < name[j])