Merge branch 'feature'

linkedlist.c

@@ -2,10 +2,8 @@
 #include <stdlib.h>
 #include "linkedlist.h"
 
-
 Node *head = NULL;
 
-
 void insert(int data)
 {
     Node *newNode = malloc(sizeof(Node));
@@ -16,7 +14,6 @@ void insert(int data)
     head = newNode;
 }
 
-
 void display()
 {
     Node *temp = head;
@@ -28,24 +25,26 @@ void display()
     }
 }
 
-int search(int value)
+Node *search(int value)
 {
     Node *temp = head;
 
     while (temp != NULL)
     {
         if (temp->data == value)
-            return 1;
+        {
+            return temp;
+        }
 
         temp = temp->next;
     }
- return 0;
+
+    return NULL;
 }
 
 int count()
 {
     int count = 0;
-
     Node *temp = head;
 
     while (temp != NULL)

linkedlist.h

@@ -1,3 +1,4 @@
+
 #ifndef LINKEDLIST_H
 #define LINKEDLIST_H
 
@@ -8,10 +9,9 @@ typedef struct Node
 
 } Node;
 
-
 void insert(int data);
 void display();
-int search(int value);
+Node *search(int value);
 int count();
 
 #endif

main.c

@@ -1,29 +1,33 @@
 #include <stdio.h>
 #include "linkedlist.h"
 
-
 int main()
 {
-
     insert(10);
     insert(20);
     insert(30);
+  printf("Linked List: ");
 
     display();
 
- int result = search(20);
+Node *result = search(20);
-
+ if (result != NULL)
-    if(result)
     {
-        printf("\nElement found");
+        printf("\n the Element found: %d\n", result->data);
     }
     else
     {
-        printf("\nElement not found");
+        printf("\n the Element not found\n");
     }
-    printf("\nTotal nodes = %d", count());
+
+    printf("Total nodes = %d\n", count());
+
+    printf("Count operation completes.\n");
+
+    printf("\nThis is Main Branch\n");
+
+    printf("\nThis is Feature Branch\n");
 
 
     return 0;
- 
 }