diff --git a/misc/huffman_coding.c b/misc/huffman_coding.c
new file mode 100644
index 0000000000..72c170b65c
--- /dev/null
+++ b/misc/huffman_coding.c
@@ -0,0 +1,205 @@
+#include<stdio.h>
+#include<stdlib.h>
+
+typedef struct Node
+{
+	float frequency;
+	char character;
+	struct Node *next;
+	struct Node *left_child;
+	struct Node *right_child;
+}node;
+
+node* sort(node*, int);
+void display(node*);
+node* delete_front(node*);
+void huffman_algo(node*);
+void print_codes(node*, int[], int);
+node* create_node();
+
+node* create_node()
+{
+	node* temp = (node*)malloc(sizeof(node));
+	temp -> next = NULL;
+	temp -> left_child = NULL;
+	temp -> right_child = NULL;
+	return temp;
+}
+
+int main()
+{
+	int n;
+	int i;
+	node* new_node;
+	node* ele;
+	node* front_node;
+	ele = NULL;
+	printf("Enter the number of characters : ");
+	scanf("%d", &n);
+	for(i = 0; i < n; ++i)
+	{
+		new_node = create_node();
+		printf("Enter the character %d and it's corresponding frequency : ", i + 1);
+		scanf(" %c", &(new_node -> character));
+		scanf("%f", &(new_node -> frequency));
+		if(ele == NULL)
+		{
+			ele = new_node;
+			front_node = new_node;
+		}
+		else
+		{
+			ele -> next = new_node;
+			ele = ele -> next;
+		}
+	}
+	ele = ele -> next;
+	front_node = sort(front_node, n);
+	printf("%d\n", n);
+	huffman_algo(front_node);
+	return 0;
+}
+
+node* sort(node* front_node, int n)
+{
+	int i;
+	node* temp;
+	node* first_node;
+	node* second_node;
+	node* curr = create_node();
+	for(i = 0; i < n; ++i)
+	{
+		temp = front_node;
+		while(temp -> next != NULL)
+		{
+			first_node = temp;
+			second_node = temp -> next;
+			if((first_node -> frequency) > (second_node -> frequency))
+			{
+				curr -> character = first_node -> character;
+				curr -> frequency = first_node -> frequency;
+				first_node -> character = second_node -> character;
+				first_node -> frequency = second_node -> frequency;
+				second_node -> character = curr -> character;
+				second_node -> frequency = curr -> frequency;
+			}
+			temp = temp -> next;
+		}
+	}
+	return front_node;
+}
+
+void huffman_algo(node* front_node)
+{
+	int finished = 0;
+	node* temp;
+	while(finished != 1)
+	{
+		temp = create_node();
+		float first_freq = front_node -> frequency;
+		float second_freq = front_node -> next -> frequency;
+		temp -> frequency = first_freq + second_freq;
+		if(first_freq < second_freq)
+		{
+			temp -> left_child = front_node;
+		       	temp -> right_child = front_node -> next;
+		}
+		else
+		{
+			temp -> left_child = front_node -> next;
+			temp -> right_child = front_node;
+		}
+		front_node = delete_front(front_node);
+		front_node = delete_front(front_node);
+		if(front_node!=NULL)
+		{
+			int done = 0;
+			node* traverse;
+       			traverse = front_node;
+			while(traverse -> next != NULL)
+			{
+				if((traverse -> frequency) <= (temp -> frequency) && ((traverse -> next) -> frequency) >= (temp -> frequency))
+				{
+					done = 1;
+					node* curr;
+					curr = traverse -> next;
+					traverse -> next = temp;
+					temp -> next = curr;
+				}
+				traverse = traverse -> next;
+			}
+			if(done == 0)
+			{
+				if((temp -> frequency) <= (front_node -> frequency))
+				{
+					temp -> next = front_node;
+					front_node = temp;
+				}
+				else
+				{
+					node* curr;
+					curr = front_node;
+					while(curr -> next != NULL)
+					{
+						curr = curr -> next;
+					}
+					curr -> next = temp;
+				}
+			}
+		}
+		else
+		{
+			finished = 1;
+		}
+	}
+	int code[100];
+	printf("\nCodes:\n");
+	print_codes(temp, code, 0);
+}
+
+void print_codes(node* temp, int code[], int k)
+{
+	if(temp -> left_child != NULL)
+	{
+		code[k] = 0;
+		print_codes(temp -> left_child, code, k + 1);
+	}
+	if(temp -> right_child != NULL)
+	{
+		code[k] = 1;
+		print_codes(temp -> right_child, code, k + 1);
+	}
+	if((temp -> left_child == NULL) && (temp -> right_child == NULL))
+	{
+		printf("%c\n", temp -> character);
+		int i = 0;
+		for(i = 0; i < k; ++i)
+		{
+			printf("%d", code[i]);
+		}
+		printf("\n\n");
+	}
+}
+
+node* delete_front(node* front_node)
+{
+	node* temp;
+	temp = front_node;
+	front_node = front_node -> next;
+	return front_node;
+}
+
+void display(node* front_node)
+{
+	printf("\n");
+	node* temp;
+        temp = front_node;
+	while(temp != NULL)
+	{
+		printf("%c", temp -> character);
+		printf("\t%f", temp -> frequency);
+		printf("\n");
+		temp = temp -> next;
+	}
+	printf("\n");
+}
diff --git a/misc/maze.c b/misc/maze.c
new file mode 100644
index 0000000000..0b743cce59
--- /dev/null
+++ b/misc/maze.c
@@ -0,0 +1,150 @@
+#include<stdio.h>
+#include<stdlib.h>
+
+typedef struct{
+	short int row;
+	short int col;
+	short int dir;
+}element;
+
+typedef struct{
+	short int horiz;
+	short int vert;
+}move;
+
+void directions(move[]);
+void game();
+void push(element[],int*,element);
+element pop(element[],int*);
+void display(element[],int*);
+
+int main()
+{	
+	game();
+	return 0;
+}
+
+void game()
+{
+	int **maze,**mark,nextRow,nextCol,row,column,i,j,TOP=-1;
+	element current,stack[50];
+	move offsets[8];
+
+	directions(offsets);
+	
+	scanf("%d%d",&row,&column);
+	
+	maze=(int**)malloc((row+2)*sizeof(int*));
+	for(i=0;i<row+2;i++)
+	{
+		*(maze+i)=(int*)malloc((column+2)*sizeof(int));
+	}
+	mark=(int**)malloc((row+2)*sizeof(int*));
+	for(i=0;i<row+2;i++)
+	{
+		*(mark+i)=(int*)malloc((column+2)*sizeof(int));
+	}
+	for(i=0;i<row+2;i++)
+	{
+		for(j=0;j<column+2;j++)
+		{
+			*(*(mark+i)+j)=0;
+		}
+	}
+
+	for(i=0;i<row+2;i++)
+	{
+		for(j=0;j<column+2;j++)
+		{
+			if(i==0||i==row+1||j==0||j==column+1)
+			{
+				*(*(maze+i)+j)=1;
+			}
+			else
+			{
+				scanf("%d",(*(maze+i)+j));
+			}
+		}
+	}
+
+	
+	current.dir=0;
+	current.row=1;
+	current.col=1;
+
+	printf("\nStarting at (1,1)\n");
+
+	while(current.dir<8&&(current.row!=row||current.col!=column))
+	{
+		nextRow=current.row+offsets[current.dir].vert;
+		nextCol=current.col+offsets[current.dir].horiz;
+
+		if(maze[nextRow][nextCol]==0&&mark[nextRow][nextCol]!=1)
+		{
+
+			mark[current.row][current.col]=1;
+			push(stack,&TOP,current);
+			current.dir=0;
+			current.row=nextRow;
+			current.col=nextCol;
+		}
+		else
+		{
+			current.dir++;
+		}
+
+		if(current.dir==8)
+		{
+			current=pop(stack,&TOP);
+		}
+	}	
+			
+	display(stack,&TOP);
+
+	printf("End at (%d,%d)\n",row,column);
+
+}
+
+void display(element stack[],int *TOP)
+{
+	int copyTOP=1;
+	while(copyTOP<=*TOP)
+	{
+		printf("Move at (%d,%d)\n",stack[copyTOP].row,stack[copyTOP].col);
+		copyTOP++;
+	}
+}
+
+void push(element stack[],int *TOP,element value)
+{
+	*TOP=*TOP+1;
+	stack[*TOP].row=value.row;
+	stack[*TOP].col=value.col;
+	stack[*TOP].dir=value.dir+1;
+}
+
+element pop(element stack[],int *TOP)
+{
+	*TOP=*TOP-1;
+	return stack[*TOP+1];
+}
+
+void directions(move offset[])
+{
+	offset[0].vert=-1;
+	offset[0].horiz=0;
+	offset[1].vert=-1;
+	offset[1].horiz=1;
+	offset[2].vert=0;
+	offset[2].horiz=1;
+	offset[3].vert=1;
+	offset[3].horiz=1;
+	offset[4].vert=1;
+	offset[4].horiz=0;
+	offset[5].vert=1;
+	offset[5].horiz=-1;
+	offset[6].vert=0;
+	offset[6].horiz=-1;
+	offset[7].vert=-1;
+	offset[7].horiz=-1;
+}
diff --git a/sorting/hashSort.c b/sorting/hashSort.c
new file mode 100644
index 0000000000..a46a787db7
--- /dev/null
+++ b/sorting/hashSort.c
@@ -0,0 +1,99 @@
+#include<stdio.h>
+#include<stdlib.h>
+
+#define MAX 5
+
+typedef struct linkedList
+{
+	int data;
+	struct linkedList *next;
+}List;
+
+int hashFunction(int n)
+{
+	while(n>10)
+	{
+		n/=10;
+	}
+	return n;
+}
+
+List* createNode()
+{
+	List* temp=(List*)malloc(sizeof(List));
+	temp->next=NULL;
+	return temp;
+}
+
+int main()
+{
+	int a[MAX], i, key;
+	List* list[10];
+	List* temp;
+
+	for(i=0; i<10; i++)
+	{
+		list[i]=NULL;
+	}
+
+	printf("Enter elements\n");
+	for(i=0; i<MAX; i++)
+	{
+		scanf("%d", &a[i]);
+	}
+
+	for(i=0; i<MAX; i++)
+	{
+		key=hashFunction(a[i]);
+	
+		if(list[key]==NULL)
+		{
+			list[key]=createNode();
+			list[key]->data=a[i];
+		}
+		else
+		{
+			while(list[key]!=NULL)
+			{
+				List* newNode=createNode();
+				newNode->data=a[i];
+			
+				if(a[i]<=(list[key]->data))
+				{
+					newNode->next=temp->next;
+					temp->next=newNode;
+				}
+			
+				if(temp->next==NULL)
+				{
+					temp->next=newNode;
+				}
+			
+				temp=temp->next;
+			}
+		}
+	}
+
+	int k=0;
+
+	for(i=0; i<10; i++)
+	{
+		if(list[i]!=NULL)
+		{
+			temp=list[i];
+			while(temp!=NULL)
+			{
+				a[k]=temp->data;
+				temp=temp->next;
+				k++;
+			}
+		}
+	}
+
+	printf("\nSorted\n");
+	for(i=0; i<MAX; i++)
+	{
+		printf("%d ", a[i]);
+	}
+	printf("\n");
+}