Merge pull request ephremdeme#68 from Vivekagent47/master

Add many problems and algos

Author: ephremdeme

Algorithms/tower_of_hanoi.c

@@ -0,0 +1,28 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+// Function for Tower of Hanoi algorithm 
+void hanoi(int noOfDisks,char where,char to,char extra){
+if(noOfDisks == 0 )
+{
+return;
+}
+else
+{
+hanoi(noOfDisks-1, where, extra , to);
+printf("Move disk : %d from %c to %c\n",noOfDisks,where,to);
+hanoi(noOfDisks-1,extra,to,where);
+}
+}
+int main(void){
+int noOfDisks;
+
+//Asks the number of disks in the tower 
+printf("Number of disks: \n");
+scanf("%d", &noOfDisks);
+
+hanoi(noOfDisks,'A','B','C');
+
+return 0;
+
+}

Algorithms/tower_of_hanoi.py

@@ -0,0 +1,13 @@
+def towerOfHanoi(n, where, to, extra):
+ if n == 0:
+ return
+ else:
+ towerOfHanoi(n-1, where, extra, to)
+ print("Move disk :", n, "from", where, "to", to)
+ towerOfHanoi(n-1, extra, to, where)
+ 
+n = int(input("number of Disks : "))
+
+print("Process of moving all disks form A to C is -")
+
+towerOfHanoi(n, "A", "B", "C")

linked-list/doubly_linked_list.c

@@ -0,0 +1,79 @@
+#include<stdio.h>
+#include<stdlib.h>
+typedef struct node{
+int data;
+struct node *prev;
+struct node *next;
+}node;
+
+node *createList(){
+node *head=NULL,*temp,*prev=NULL;
+int data,num;
+printf("Enter the number of nodes: ");
+scanf("%d",&num);
+while(num--){
+printf("Enter the data: ");
+scanf("%d",&data);
+node *newNode = (node *)malloc(sizeof(node));
+newNode->prev=NULL;
+newNode->next=NULL;
+newNode->data=data;
+if(!head){
+head = newNode;
+temp=head;
+}else{
+temp->next = newNode;
+newNode->prev=temp;
+temp=newNode;
+}
+}
+return head;
+}
+void displayList(node *head){
+node *temp = head;
+if(temp){
+printf("%d ",temp->data);
+displayList(temp->next);
+}
+}
+void insertNodeEnd(node *head){
+node *temp = head;
+int data;
+printf("Enter the data: ");
+scanf("%d",&data);
+while(temp->next){
+temp=temp->next;
+}
+node *newNode = (node *)malloc(sizeof(node));
+newNode->data=data;
+newNode->next=NULL;
+newNode->prev=temp;
+temp->next=newNode;
+}
+void insertNodeMid(node *head, int pos){
+node *temp = head;
+node *newNode = (node *)malloc(sizeof(node));
+int data;
+printf("Enter the data: ");
+scanf("%d",&data);
+newNode->data = data;
+pos-=2;
+while(pos--){
+temp=temp->next;
+}
+newNode->prev=temp;
+newNode->next=temp->next;
+temp->next=newNode;
+}
+
+int main(){
+node *head=NULL;
+head = createList();
+displayList(head);
+printf("\n");
+//insertNodeEnd(head);
+insertNodeMid(head,4);
+displayList(head);
+printf("\n");
+return 0;
+}

linked-list/linked_list.c

@@ -0,0 +1,123 @@
+//AN IMPROVED IMPLEMENTATION OF LINKED LISTS WITH SEPARATE FUNCTIONS FOR OPERATIONS//
+#include<stdio.h>
+#include<stdlib.h>
+struct node{
+int i;
+struct node *next;
+};
+struct node *insertNodeEnd(struct node*, int);
+struct node *insertNodeBeg(struct node*, int);
+struct node *insertAfter(struct node*, int,int);
+struct node *deleteNode(struct node*, int);
+struct node *reverseList(struct node *head);
+void displayList(struct node*);
+void deleteList(struct node*);
+
+int main(){
+struct node* head = NULL; //HEADER FOR LIST
+int n,data;
+printf("Enter the number of nodes you want to create: ");
+scanf("%d",&n);
+while(n--){
+printf("Enter the data: ");
+scanf("%d",&data);
+head = insertNodeEnd(head,data);
+}
+//head = insertNodeBeg(head,100);
+//displayList(head);
+//head = insertAfter(head,3,89);
+displayList(head);
+//head = deleteNode(head,5);
+head = reverseList(head);
+displayList(head);
+deleteList(head);
+return 0;
+}
+
+struct node *insertNodeEnd(struct node* head,int data){
+struct node* temp,p;
+temp = head;
+struct node* newNode = (struct node*)malloc(sizeof(struct node));
+newNode->i = data;
+newNode->next = NULL;
+if(head==NULL){
+head = newNode;
+}else{
+while(temp->next!=NULL){
+temp=temp->next;
+}
+temp->next = newNode;
+}
+return head;
+}
+struct node *insertNodeBeg(struct node *head, int data){
+struct node *newNode = (struct node *)malloc(sizeof(struct node));
+newNode->next = head;
+newNode->i = data;
+head = newNode;
+return head;
+}
+struct node *insertAfter(struct node *head, int pos, int data){
+struct node *newNode = (struct node *)malloc(sizeof(struct node));
+struct node *temp = head;
+newNode->i = data;
+int i =0;
+while(i<(pos-1)){
+temp = temp->next;
+i++;
+}
+newNode->next = temp->next;
+temp->next = newNode;
+return head;
+}
+void displayList(struct node* head){
+struct node* temp;
+temp = head;
+if(temp!=NULL){
+printf("%d -> ",temp->i);
+displayList(temp->next);
+}
+}
+void deleteList(struct node *head){
+struct node *temp;
+while(head->next!=NULL){
+temp = head;
+free(temp->next);
+head = head->next;
+}
+free(head->next);
+}
+struct node *deleteNode(struct node* head, int pos){
+struct node *temp = head;
+struct node *pp = NULL;
+////// IF 1st node is deleted
+if(pos==1){
+head = head->next;
+free(temp);
+}else{
+int i = 0;
+while(i<(pos-2)){
+temp=temp->next;
+i++;
+}
+if((temp->next)->next != NULL){
+pp = (temp->next)->next;
+free(temp->next);
+temp->next = pp;
+}else{
+free(temp->next);
+temp->next = NULL;
+}
+}
+return head;
+}
+struct node *reverseList(struct node *curr){
+struct node *prev = NULL, *nextNode = NULL;
+while(curr){
+nextNode = curr->next;
+curr->next = prev;
+prev = curr;
+curr = nextNode;
+}
+return prev;
+}

queue/circularQueue_using_Array.c

@@ -0,0 +1,70 @@
+#include<stdio.h>
+#define MAX 100
+int queue[MAX];
+int front=-1,rear=-1;
+void enqueue(int data){
+rear = (rear+1)%MAX;
+if(front==rear){
+printf("\nQUEUE OVERFLOW\n");
+if(rear==0)rear = MAX-1;
+elserear = rear-1;
+return;
+}
+if(front==-1)front=0;
+queue[rear]=data;
+}
+int dequeue(){
+if(front==-1){
+printf("\nQUEUE UNDERFLOW! NO ITEMS IN THE QUEUE\n");
+return -1;
+}
+int data = queue[front];
+if(front==rear){
+front=-1;
+rear=-1;
+}else{
+front = (front+1)%MAX;
+}
+return data;
+}
+void printQueue(){
+int temp = front;
+if(temp==-1){
+printf("\nLMAO! NOTHING TO DISPLAY\n");
+return;
+}
+if(rear>=temp){
+while(temp<=rear){
+printf("%d ",queue[temp]);
+++temp;
+}
+}else{
+if(temp>rear){
+while(temp<MAX){
+printf("%d ",queue[temp]);
+++temp;
+}
+temp=0;
+while(temp<=rear){
+printf("%d ",queue[temp]);
+++temp;
+}
+}
+}
+printf("\n");
+}
+int main(){
+int num,data;
+printf("How many items you want to add in the queue?");
+scanf("%d",&num);
+while(num--){
+printf("Enter the data: ");
+scanf("%d",&data);
+enqueue(data);
+}
+printQueue();
+data = dequeue();
+printf("\nData dequeued is: %d\n",data);
+printQueue();
+return 0;
+}