Add files via upload

Author: skjha1

LinkedList/Basic Consept/13 Remove duplicate.c

@@ -0,0 +1,78 @@
+
+#include <stdio.h>
+#include <stdlib.h>
+struct Node
+{
+	int data;
+	struct Node* next;
+}*first=NULL;
+void Create(int A[], int n)
+{
+	int i;
+	struct Node* last, * t;
+	first = (struct Node*)malloc(sizeof(struct Node));
+	first->data = A[0];
+	first->next = NULL;
+	last = first;
+
+	for (i = 1; i < n; i++)
+	{
+		t = (struct Node*)malloc(sizeof(struct Node));
+		t->data = A[i];
+		t->next = NULL;
+		last->next = t;
+		last = t;
+	}
+}
+void Display(struct Node* p)
+{
+	while (p != NULL)
+	{
+		printf("->%d", p->data);
+		p = p->next;
+	}
+}
+void RDisplay(struct Node* p)
+{
+	if (p!=NULL)
+	{
+		printf("->%d", p->data);
+		RDisplay(p->next);
+	}
+}
+
+// Remove duplicate from ll ; if nodes data are same del that ; from sorted linkedlist 
+void Removeduplicate(struct Node* p) // taking pointer to 1st node 
+{
+	// inside fxn we want  one more pointer 
+	struct Node* q = p->next; // which will before p  // q is ahead and p is following 
+	while (q != NULL)
+	{
+		if (p->data != q->data) // if data is not matching  // means no duplicate 
+		{
+			p = q; // move ahead 
+			q = q->next;
+		}
+		else // if there is duplicate value 
+		{
+			p->next = q->next;  // p next points on  q next //q will be logically remove from ll 
+			free(q); // delete q 
+			q = p->next; // and move q to next  
+		}
+	}
+}
+
+
+
+
+int main()
+{
+	int A[] = {10,10,10,10,20,20,20,30,40,50 };
+	Create(A, sizeof (A)/sizeof (int ));
+	Removeduplicate(first);
+		Display(first);
+		printf("\n\n");
+
+	return 0;
+
+}

LinkedList/Basic Consept/14 Reversing Using Array.c

@@ -0,0 +1,82 @@
+#include <stdio.h>
+#include <stdlib.h>
+struct Node
+{
+	int data;
+	struct Node* next;
+}*first=NULL;
+void Create(int A[], int n)
+{
+	int i;
+	struct Node* last, * t;
+	first = (struct Node*)malloc(sizeof(struct Node));
+	first->data = A[0];
+	first->next = NULL;
+	last = first;
+
+	for (i = 1; i < n; i++)
+	{
+		t = (struct Node*)malloc(sizeof(struct Node));
+		t->data = A[i];
+		t->next = NULL;
+		last->next = t;
+		last = t;
+	}
+}
+void Display(struct Node* p)
+{
+	while (p != NULL)
+	{
+		printf("->%d", p->data);
+		p = p->next;
+	}
+}
+int count(struct Node* p)
+{
+	int c = 0;
+	while (p != NULL)
+	{
+		c++;
+		p = p->next;
+	}
+	return c;
+}
+
+// reversing ll using array 
+void Reverse1(struct Node* p) // pointer to 1st node 
+{
+	int* A,i=0; // for storing reversed linkedlist we need an array & and its size is not known so we will find the length of ll // for that we created an array dynamically 
+	struct Node* q=p; // for traversing we will take one more pointer that will help in traversing 
+	A = (int*)malloc(sizeof(int) * count(p)); // create an array size is length of ll // size of int type // mul by length of ll // array is created 
+	while (q != NULL) 
+	{
+		A[i] = q->data; // everytime copy data from q to array 
+		q= q->next; // and move q to next 
+		i++; // increment i
+
+	}
+	// once it reach end of linkedlist all element copied in array 
+	q = p;// q sud again strat from 1st pointer  i.e p
+	i--; // i shoud go back
+	while (q != NULL)
+	{
+		q->data = A[i]; // we will copy in reverse manner 
+		q = q->next; // move q to next 
+		i--;
+
+	}
+
+}
+
+
+int main()
+{
+	int A[] = { 10,20,30,40,50 };
+	Create(A, sizeof (A)/sizeof (int ));
+	Reverse1(first);
+	Display(first);
+	printf("\n\n");
+
+	return 0;
+
+}

LinkedList/Basic Consept/15 Reversing Using Sliding Links.c

@@ -0,0 +1,71 @@
+	
+#include <stdio.h>
+#include <stdlib.h>
+struct Node
+{
+	int data;
+	struct Node* next;
+}*first=NULL;
+void Create(int A[], int n)
+{
+	int i;
+	struct Node* last, * t;
+	first = (struct Node*)malloc(sizeof(struct Node));
+	first->data = A[0];
+	first->next = NULL;
+	last = first;
+
+	for (i = 1; i < n; i++)
+	{
+		t = (struct Node*)malloc(sizeof(struct Node));
+		t->data = A[i];
+		t->next = NULL;
+		last->next = t;
+		last = t;
+	}
+}
+void Display(struct Node* p)
+{
+	while (p != NULL)
+	{
+		printf("->%d", p->data);
+		p = p->next;
+	}
+}
+void RDisplay(struct Node* p)
+{
+	if (p!=NULL)
+	{
+		printf("->%d", p->data);
+		RDisplay(p->next);
+	}
+}
+// using sliding pointer 
+void Reverse2(struct Node* p) // 1st node pointer
+{
+	struct Node* q = NULL, *r = NULL; // we requre three pointer p,q,r
+	p = first; 
+	while (p != NULL)
+	{/*
+	 sliding pointer */
+		r = q; // r  sud come upon q
+		q = p;// q sud come upon p
+		p = p->next;// p sud move to next node 
+		q->next = r;// q next sud points on 
+	}
+	first = q; // once we came out of while loop // 1st ointer sud point on q 
+
+}
+
+
+int main()
+{
+	int A[] = { 10,20,30,40,50 };
+	Create(A, sizeof (A)/sizeof (int ));
+	Reverse2(first);
+	Display(first);
+	printf("\n\n");
+
+	return 0;
+
+}

LinkedList/Basic Consept/16 Reversing using Recursion.c

@@ -0,0 +1,66 @@
+#include <stdio.h>
+#include <stdlib.h>
+struct Node
+{
+	int data;
+	struct Node* next;
+}*first=NULL;
+void Create(int A[], int n)
+{
+	int i;
+	struct Node* last, * t;
+	first = (struct Node*)malloc(sizeof(struct Node));
+	first->data = A[0];
+	first->next = NULL;
+	last = first;
+
+	for (i = 1; i < n; i++)
+	{
+		t = (struct Node*)malloc(sizeof(struct Node));
+		t->data = A[i];
+		t->next = NULL;
+		last->next = t;
+		last = t;
+	}
+}
+void Display(struct Node* p)
+{
+	while (p != NULL)
+	{
+		printf("->%d", p->data);
+		p = p->next;
+	}
+}
+void RDisplay(struct Node* p)
+{
+	if (p!=NULL)
+	{
+		printf("->%d", p->data);
+		RDisplay(p->next);
+	}
+}
+
+
+//reversing using Recursion 
+void Rreverse(struct Node* q, struct Node* p) // taking two pointer p and q ; p will always ahead and q will follow that;
+{
+	if (p != NULL)
+	{
+		Rreverse(p, p->next); //  passing two pointer
+		p->next = q;// while recturnig  it will make p next as q 
+	}
+	else
+		first = q; // while p i null make first as q ;
+}
+
+int main()
+{
+	int A[] = { 10,20,30,40,50 };
+	Create(A, sizeof (A)/sizeof (int ));
+	Rreverse(NULL,first);
+	Display(first);
+	printf("\n\n");
+
+	return 0;
+
+}