X pattern print

ARRAY.c

@@ -0,0 +1,199 @@
+//ARRAY simple operations
+#include<stdio.h>
+#include<stdlib.h>
+
+int arr[100],i,j,position,n,element,choice;
+
+void menu();
+
+void insertion(){
+    printf("ENTER THE POSITION YOU WANT TO ENTER THE ELEMENT");
+    scanf("%d",&position);
+    position=position-1;
+    if(position>n-1){
+        printf("\n INVALID POSITION\n");
+        menu();
+    }
+    printf("ENTER THE ELEMENT ");
+    scanf("%d",&element);
+    for(i=n;i>=position;i--){
+        arr[i+1]=arr[i];
+    }
+    arr[position]=element;
+    n=n+1;
+    menu();
+}
+
+void traversing(){
+    printf("\n THE ARRAY ENTERED IS:--\n");
+    for(i=0;i<n;i++){
+       printf("%d\t",*(arr+i));
+    }
+    menu();
+}
+
+void deletion(){
+    printf("ENTER THE POSITION OF THE ELEMENT TO BE DELETED");
+    scanf("%d",&position);
+    position=position-1;
+        if(position>n-1){
+        printf("\n INVALID POSITION\n");
+        menu();
+    }
+    for(i=position;i<n;i++){
+        arr[i]=arr[i+1];
+    }
+    printf("ELEMENT IS DELETED!!!\n");
+    n=n-1;
+    menu();
+}
+
+void updation(){
+    printf("ENTER THE POSITION WHERE U WANT TO UPDATE");
+    scanf("%d",&position);
+    if(position>n){
+        printf("\n INVALID POSITION\n");
+        menu();
+    }
+    printf("\n ENTER THE ELEMENT :-");
+    scanf("%d",&element);
+    arr[position]=element;
+
+}
+
+void linear_search(){
+    printf("ENTER THE ELEMENT YOU WANT TO SEARCH\n");
+    scanf("%d",&element);
+    for(i=0;i<n;i++){
+        if(arr[i] == element){
+            printf("ELEMENT FOUND AT THE POSITION %d\n\n",i+1);
+            choice=20;
+            break;
+        }
+    }
+    if(choice!=20){
+        printf("\nELEMNT NOT FOUND!!!");
+    }
+    menu();
+}
+bubble_sort_algo(){
+    for(i=0;i<n;i++){
+        for(j=0;j<n-i-1;j++){
+            if(arr[j] > arr[j+1]){
+                arr[j]=arr[j]+arr[j+1];
+                arr[j+1]=arr[j]-arr[j+1];
+                arr[j]=arr[j]-arr[j+1];
+            }
+        }
+    }
+}
+void bubble_sort(){
+    bubble_sort_algo();
+    printf("\nTHE ARRAY HAS BEEN SORTED\n");
+    menu();
+}
+
+void binary_search(){
+    printf("ENTER THE ELEMENT YOU WANT TO SEARCH\n");
+    scanf("%d",&element);
+    int beg,mid,end,check;
+    check=0;
+    beg=0;
+    end=n-1;
+    bubble_sort_algo();
+    while(beg<=end){
+        mid=(beg+end)/2;
+        if(arr[mid]==element){
+            printf("ELEMENT FOUND AT POSITION: %d, AFTER THE SORTING",mid+1);
+            check=10;
+            break;
+        }
+        else if(arr[mid]>element){
+            end = mid-1;
+        }
+        else if(arr[mid]<element){
+            beg = mid+1;
+        }
+    }
+    if(check!=10){
+        printf("ELEMENT NOT FOUND IN THE ARRAY!!!");
+    }
+    menu();
+}
+
+selection_sort(){
+    for(i=0;i<n-1;i++){
+        for(j=i+1;j<n;j++){
+            if(arr[i]>arr[j]){
+                arr[i]=arr[i]+arr[j];
+                arr[j]=arr[i]-arr[j];
+                arr[i]=arr[i]-arr[j];
+            }
+        }
+    }
+    printf("ARRAY IS SORTED");
+    menu();
+}
+
+
+void menu(){
+       while(1){
+            printf("\n1. INSERTION\t 2. UPDATION\t 3. TRAVERSING\t 4. DELETION\t 5.EXIT\t 6. RECREATE THE ARRAY \n");
+            printf("7. LINEAR SEARCH\t 8. BUBBLE SORT\t 9. BINARY SEARCH\t 10. SELECTION SORT\n\n");
+            scanf("%d",&choice);
+            switch(choice){
+                case 1:
+                    insertion();
+                    break;
+                case 2:
+                    updation();
+                    break;
+                case 3:
+                    traversing();
+                    break;
+                case 4:
+                    deletion();
+                    break;
+                case 5:
+                    exit(1);
+                case 6:
+                    main();
+                    break;
+                case 7:
+                    linear_search();
+                    break;
+                case 8:
+                    bubble_sort();
+                    break;
+                case 9:
+                    binary_search();
+                    break;
+                case 10:
+                    selection_sort();
+                    break;
+                default:
+                    menu();
+                    break;
+            }
+        }
+
+}
+
+int main(){
+
+    printf("ENTER THE ELEMENTS OF ARRAY");
+    i=0;
+    while(1){
+    printf("\nENTER THE ELEMENT:-\n");
+    scanf("%d",arr+i);
+    printf("\nDO YOU WANT TO ENTER ANOTHER ELEMENT PRESS ANY KEY ELSE PRESS 1\n");
+    scanf("%d",&choice);
+    if(choice == 1){
+        n=i+1;
+        menu();
+    }
+    i++;
+   }
+
+   return 0;
+}

Adding_Fractions.c

@@ -0,0 +1,28 @@
+#include <stdio.h>
+int main(){
+	/* variable declaration */
+	int numerator1, numerator2, denominator1, denominator2, 
+num_result, denom_result ;
+	/* Read each fraction */
+	printf("Please provide the first numerator:\n");
+	scanf("%d",&numerator1);
+	printf("Please provide the first denominator:\n");
+	scanf("%d",&denominator1);
+ 	printf("Please provide the second numerator:\n");
+        scanf("%d",&numerator2);
+	printf("Please provide the second denominator:\n");
+	scanf("%d",&denominator2);
+	/*compare the demonators*/
+	if ( denominator1 == denominator2 ) {
+		num_result = numerator1 + numerator2;
+		denom_result = denominator1; /*  or 2, they are equal */
+	} else {
+		num_result = (numerator1 * denominator2) + (numerator2 * denominator1 );
+		denom_result = denominator1 * denominator2;
+	}
+	printf("The result of %d / %d  + %d / %d  is: %d / %d \n", numerator1,denominator1, numerator2, denominator2,num_result,denom_result);
+	return 0;
+}
+
+
+

Addition.c

@@ -0,0 +1,8 @@
+#include<stdio.h>
+void main()
+{ int a,b,c;
+printf("Enter two Numbers : ");
+scanf("%d %d",&a,&b);
+c=a+b;
+printf("The Sum is %d",c);
+}

Address of 1-D array

@@ -0,0 +1,30 @@
+//The & operator is used to get the address.
+//But in case of array the name of array itself returns its address.
+//In array the elements occupy consecutive address,
+//therefore incrementing it by 1 each time would give
+//the address of next element.
+
+#include<stdio.h>
+int main()
+{
+	int a[100],i,n,*add;
+
+	printf("enter the size: ");
+	scanf("%d",&n);
+
+	printf("enter the numbers: \n");
+	for(i=0;i<n;i++)
+	{
+		scanf("%d",&a[i]);
+	}
+
+	for(i=0;i<n;i++)
+	{
+		add=a+i;
+		//add = &a[i]; would also return the same thing.
+		printf("The address of element %d is %u.\n",*add, add);	
+
+		//Notice: As size of int is 4-byte the differnce in address
+		//of cosecutive elements is 4.
+	}
+}

Anagram-Program-in-C

@@ -0,0 +1,71 @@
+#include <stdio.h>  
+#include <string.h> 
+#include <stdlib.h>  
+
+int checkAnagram(char *str1, char *str2);
+
+int main()
+{
+    char str1[100], str2[100];
+
+    printf("Function : whether two given strings are anagram :");
+    printf("\nExample : pears and  spare, stone and tones :");
+
+    printf(" Input the  first String : ");
+    fgets(str1, sizeof str1, stdin);
+    printf(" Input the  second String : ");
+    fgets(str2, sizeof str2, stdin);
+
+    if(checkAnagram(str1, str2) == 1)
+    {
+       str1[strlen(str1)-1] = '\0';
+       str2[strlen(str2)-1] = '\0';
+       printf(" %s and %s are Anagram.\n\n",str1,str2);
+    } 
+    else 
+    {
+       str1[strlen(str1)-1] = '\0';
+       str2[strlen(str2)-1] = '\0';
+       printf(" %s and %s are not Anagram.\n\n",str1,str2);
+    }
+    return 0;
+}
+
+
+//Function to check whether two passed strings are anagram or not
+
+int checkAnagram(char *str1, char *str2)
+{
+    int str1ChrCtr[256] = {0}, str2ChrCtr[256] = {0};
+    int ctr;
+
+    /* check the length of equality of Two Strings */
+
+    if(strlen(str1) != strlen(str2))
+    {
+        return 0;
+    }
+
+    //count frequency of characters in str1 
+
+    for(ctr = 0; str1[ctr] != '\0'; ctr++)
+    {
+        str1ChrCtr[str1[ctr]]++;
+    }
+
+    //count frequency of characters in str2 
+
+    for(ctr = 0; str2[ctr] != '\0'; ctr++)
+    {
+        str2ChrCtr[str2[ctr]]++;
+    }
+
+    //compare character counts of both strings 
+
+    for(ctr = 0; ctr < 256; ctr++)
+    {
+        if(str1ChrCtr[ctr] != str2ChrCtr[ctr])
+            return 0;
+    }
+    return 1;
+}

Area_of_Circle.c

@@ -0,0 +1,8 @@
+#include<stdio.h>
+void main()
+{ float a,r;
+printf("Enter the Radius : ");
+scanf("%f",&r);
+a=3.14*r*r;
+printf("Area is %f",a);
+}

Area_of_Square.c

@@ -0,0 +1,8 @@
+#include<stdio.h>
+void main()
+{ float a,r;
+printf("Enter the Radius : ");
+scanf("%f",&s);
+a=s*s;
+printf("Area is %f",a);
+}

Area_of_Triangle.c

@@ -0,0 +1,10 @@
+#include<stdio.h>
+void main()
+{ float a,b,h;
+printf("Enter the base : ");
+scanf("%f",&b);
+printf("Enter the height : ");
+scanf("%f",&h);
+a=0.5*b*h;
+printf("Area is %f",a);
+}

Automorphic_number.c

@@ -0,0 +1,24 @@
+#include<stdio.h>
+#include<stdlib.h>
+#include<math.h>
+int main() {
+  int num, sqr, temp, last;
+  int n = 0;
+  printf("Enter a number \n");
+  scanf("%d", & num);
+  sqr = num * num; //calculating square of num
+  temp = num;
+  //Counting number of digits
+  while (temp > 0) {
+    n++;
+    temp = temp / 10;
+  }
+  //Extracting last n digits
+  int den = floor(pow(10, n));
+  last = sqr % den;
+  if (last == num)
+    printf("Automorphic number \n");
+  else
+    printf("Not Automorphic \n");
+  return 0;
+}