added more codes

Author: Lavin-tom

Strings/palindrome_string.c

@@ -28,7 +28,7 @@ int string_length (char *a)
 	for(i=0;a[i];i++);
 	return i;
 }
-//function for reverese the string 
+//function for reverse the string 
 int reverse_string(char *a,int length)
 {
 	int i,j;

array/adding_elements.c

@@ -1,21 +1,21 @@
-//adding elements
-
-#include<stdio.h>
-#define size 5
-int main()
-{
-    int arr[size],data,pos;
-    printf("enter array elements..\n");
-    for(int i=0;i<5;i++)
-        scanf("%d",&arr[i]);
-    
-    printf("Enter position and data\n");
-    scanf("%d %d",&pos,&data);
-
-    for(int i=size-1;i>=pos;i--)
-        arr[i+1]= arr[i];
-
-    arr[pos] = data;
-    for(int i=0;i<=size;i++)
-        printf("%d ",arr[i]);
+//adding elements
+
+#include<stdio.h>
+#define size 5
+int main()
+{
+    int arr[size],data,pos;
+    printf("enter array elements..\n");
+    for(int i=0;i<5;i++)
+        scanf("%d",&arr[i]);
+    
+    printf("Enter position and data\n");
+    scanf("%d %d",&pos,&data);
+
+    for(int i=size-1;i>=pos;i--)
+        arr[i+1]= arr[i];
+
+    arr[pos] = data;
+    for(int i=0;i<=size;i++)
+        printf("%d ",arr[i]);
 }

array/binary_search.c

@@ -1,67 +1,67 @@
-//binary serach 
-
-#include<stdio.h>
-#include<stdlib.h>
-#define size 5
-void setArray(int arr[])
-{
-    printf("enter array elements\n");
-    for(int i=0;i<size;i++)
-    {
-        scanf("%d",&arr[i]);
-    }
-}
-void getArray(int arr[])
-{
-    for(int i=0;i<size;i++)
-    {
-        printf("%d ",arr[i]);
-    }
-}
-//selection sort algorithm
-void sortArray(int arr[])
-{
-    for(int i=0;i<size;i++)
-    {
-        for(int j=i;j<size;j++)
-        {
-            if(arr[i]>arr[j])
-            {
-                arr[i] = arr[i] + arr[j];
-                arr[j] = arr[i] - arr[j];
-                arr[i] = arr[i] - arr[j];
-            }
-        }
-    }
-}
-void binarySearch(int arr[])
-{
-    int left = 0,right = size-1, middle,data,found_flag=0;
-    printf("\nenter data to search\n");
-    scanf("%d",&data);
-    while(left <= right)
-    {
-        middle = (left+right)/2;
-        if(arr[middle] < data)
-            left = middle+1;
-        else if(arr[middle] > data)
-            right = middle-1;
-        else if(arr[middle]==data)
-        {
-            printf("%d found at position : %d",data,middle);
-            found_flag = 1;
-            break;
-        }    
-    }
-    if(!found_flag)
-            printf("%d is not found in the array\n",data);
-}
-int main()
-{
-    int *arr = (int*)malloc(size*sizeof(int));
-    setArray(arr);
-    sortArray(arr);
-    getArray(arr);
-    binarySearch(arr);
-    free(arr);
+//binary serach 
+
+#include<stdio.h>
+#include<stdlib.h>
+#define size 5
+void setArray(int arr[])
+{
+    printf("enter array elements\n");
+    for(int i=0;i<size;i++)
+    {
+        scanf("%d",&arr[i]);
+    }
+}
+void getArray(int arr[])
+{
+    for(int i=0;i<size;i++)
+    {
+        printf("%d ",arr[i]);
+    }
+}
+//selection sort algorithm
+void sortArray(int arr[])
+{
+    for(int i=0;i<size;i++)
+    {
+        for(int j=i;j<size;j++)
+        {
+            if(arr[i]>arr[j])
+            {
+                arr[i] = arr[i] + arr[j];
+                arr[j] = arr[i] - arr[j];
+                arr[i] = arr[i] - arr[j];
+            }
+        }
+    }
+}
+void binarySearch(int arr[])
+{
+    int left = 0,right = size-1, middle,data,found_flag=0;
+    printf("\nenter data to search\n");
+    scanf("%d",&data);
+    while(left <= right)
+    {
+        middle = (left+right)/2;
+        if(arr[middle] < data)
+            left = middle+1;
+        else if(arr[middle] > data)
+            right = middle-1;
+        else if(arr[middle]==data)
+        {
+            printf("%d found at position : %d",data,middle);
+            found_flag = 1;
+            break;
+        }    
+    }
+    if(!found_flag)
+            printf("%d is not found in the array\n",data);
+}
+int main()
+{
+    int *arr = (int*)malloc(size*sizeof(int));
+    setArray(arr);
+    sortArray(arr);
+    getArray(arr);
+    binarySearch(arr);
+    free(arr);
 }

enum/typedef_and_enum.c

@@ -0,0 +1,43 @@
+//typedef and enum 
+#include<stdio.h>
+
+typedef enum {
+   MONDAY,
+   TUESDAY,
+   WEDNESDAY,
+   THURSDAY,
+   FRIDAY,
+   SATURDAY,
+   SUNDAY
+} Weekday;
+
+int main() {
+   Weekday today = MONDAY;
+   switch (today) {
+      case MONDAY:
+         printf("Today is Monday\n");
+         break;
+      case TUESDAY:
+         printf("Today is Tuesday\n");
+         break;
+      case WEDNESDAY:
+         printf("Today is Wednesday\n");
+         break;
+      case THURSDAY:
+         printf("Today is Thursday\n");
+         break;
+      case FRIDAY:
+         printf("Today is Friday\n");
+         break;
+      case SATURDAY:
+         printf("Today is Saturday\n");
+         break;
+      case SUNDAY:
+         printf("Today is Sunday\n");
+         break;
+      default:
+         printf("Invalid day\n");
+         break;
+   }
+   return 0;
+}

random_pgrms/factorial_recursion.c

@@ -1,21 +1,20 @@
 //factorial using recursion
-
 #include<stdio.h>
 int factorial(int,int);
 int main()
 {
 	int n,res=0,fact=1;
 	printf("enter the no\n");
 	scanf("%d",&n);
-	res=factorial(n,fact);
+	res=factorial(n,fact);					
 	printf("factorial of %d is %d\n",n,res);
 }
-int factorial(int a,int fact)
+int factorial(int n,int fact) 			
 {
-	if(a==1)
+	if(n==1)
 		return fact;
 	else
-		fact=fact*a;
+		fact=fact*n;
 
-	factorial(a-1,fact);
+	factorial(n-1,fact);
 }