From cd6328b1cd52c515a58bc267c413e8bcf9490255 Mon Sep 17 00:00:00 2001
From: richard937 <papuncharan@gmail.com>
Date: Wed, 1 Jan 2020 17:07:22 +0530
Subject: [PATCH] Added ReverseTheLinkedList.cpp

---
 Linked List/ReverseTheLinkedList.cpp |  75 ++++++++++++++++++++
 Sorting Algos/countsort.cpp          | 102 +++++++++++++--------------
 2 files changed, 126 insertions(+), 51 deletions(-)
 create mode 100644 Linked List/ReverseTheLinkedList.cpp

diff --git a/Linked List/ReverseTheLinkedList.cpp b/Linked List/ReverseTheLinkedList.cpp
new file mode 100644
index 0000000..ee5cd9c
--- /dev/null
+++ b/Linked List/ReverseTheLinkedList.cpp	
@@ -0,0 +1,75 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+struct node {
+	int data;
+	node *link;
+};
+
+node *head;
+
+//print the list
+void show() {
+	cout<<"The list is"<<endl;
+	node *temp = head;
+	while(temp!=NULL)
+	{
+		cout<<temp->data<<" ";
+		temp=temp->link;
+	}
+	cout<<endl;
+}
+
+
+//insertaion at first
+void addfirst(int n) {
+	node *temp = new node;
+	temp->data = n;
+	temp->link = NULL;
+	
+	
+	if(head!=NULL) {
+		temp->link = head;		
+	}
+	
+	head = temp;
+}
+
+
+//reverse a list
+node* rev() {
+	node *cur,*prev,*next;
+	
+	cur = head;
+	prev = NULL;
+	while(cur != NULL) {
+		
+		next = cur->link;
+		cur->link = prev;
+		
+		prev = cur;
+		cur = next;
+		
+	}
+	head = prev;
+	return head;
+}
+
+
+int main() {
+	head=NULL;
+	
+	addfirst(1);
+	addfirst(54);
+	addfirst(21);
+	addfirst(44);
+	addfirst(15);
+	show();
+	
+	rev();
+	cout<<"After reversing ";
+	show();
+	
+	return 0;
+}
+
diff --git a/Sorting Algos/countsort.cpp b/Sorting Algos/countsort.cpp
index 7b1b66e..7dfe05f 100644
--- a/Sorting Algos/countsort.cpp	
+++ b/Sorting Algos/countsort.cpp	
@@ -1,51 +1,51 @@
-#include<iostream>
-#include<string>
-#define n 200
-
-using namespace std;
-
-void count_sort(int ch[],int num){
-	int arr[n];
-	int temp,i=0;
-	for(i=0;i<n;i++){
-		arr[i]=0;
-	}	
-	
-	for(i=0;i<num;i++){
-		temp=ch[i];
-		arr[temp]++;
-	}	
-	
-	for(i=1;i<n;i++){
-		arr[i]+=arr[i-1];
-	}	
-	for(i=n-1;i>=0;i--){
-		arr[i]=arr[i-1];
-	}
-	
-	int outputarr[num];
-	for(i=0;i<num;i++ ){
-		temp=ch[i];
-		outputarr[arr[temp]]=temp;
-		arr[temp]++;
-	}
-	for(i=0;i<num;i++){
-		ch[i]=outputarr[i];	
-	}
-	
-}
-
-int main(){
-	cout<<"Input format :  Number of elements of array\n                The elements\n";
-	int k,i=0;
-	scanf("%d",&k);
-	int a[k];
-	for(i=0;i<k;i++){
-		cin>>a[i];
-	}
-	count_sort(a,k);
-	for(i=0;i<k;i++){
-		cout<<a[i]<<" ";
-	}
-	return 0;
-}
+#include<iostream>
+#include<string>
+#define n 200
+
+using namespace std;
+
+void count_sort(int ch[],int num){
+	int arr[n];
+	int temp,i=0;
+	for(i=0;i<n;i++){
+		arr[i]=0;
+	}	
+	
+	for(i=0;i<num;i++){
+		temp=ch[i];
+		arr[temp]++;
+	}	
+	
+	for(i=1;i<n;i++){
+		arr[i]+=arr[i-1];
+	}	
+	for(i=n-1;i>=0;i--){
+		arr[i]=arr[i-1];
+	}
+	
+	int outputarr[num];
+	for(i=0;i<num;i++ ){
+		temp=ch[i];
+		outputarr[arr[temp]]=temp;
+		arr[temp]++;
+	}
+	for(i=0;i<num;i++){
+		ch[i]=outputarr[i];	
+	}
+	
+}
+
+int main(){
+	cout<<"Input format :  Number of elements of array\n                The elements\n";
+	int k,i=0;
+	scanf("%d",&k);
+	int a[k];
+	for(i=0;i<k;i++){
+		cin>>a[i];
+	}
+	count_sort(a,k);
+	for(i=0;i<k;i++){
+		cout<<a[i]<<" ";
+	}
+	return 0;
+}