diff --git a/bubbleSort.py b/BubbleSort/bubbleSort.py
similarity index 100%
rename from bubbleSort.py
rename to BubbleSort/bubbleSort.py
diff --git a/bubblesort.md b/BubbleSort/bubblesort.md
similarity index 100%
rename from bubblesort.md
rename to BubbleSort/bubblesort.md
diff --git a/Bucket Sort.md b/BucketSort/Bucket Sort.md
similarity index 100%
rename from Bucket Sort.md
rename to BucketSort/Bucket Sort.md
diff --git a/bucket_sort.py b/BucketSort/bucket_sort.py
similarity index 100%
rename from bucket_sort.py
rename to BucketSort/bucket_sort.py
diff --git a/Heapsort.md b/HeapSort/Heapsort.md
similarity index 100%
rename from Heapsort.md
rename to HeapSort/Heapsort.md
diff --git a/Heapsort.py b/HeapSort/Heapsort.py
similarity index 100%
rename from Heapsort.py
rename to HeapSort/Heapsort.py
diff --git a/README.md b/README.md
index 69cadbe..e9656b6 100644
--- a/README.md
+++ b/README.md
@@ -9,15 +9,16 @@
 - Please use 3.x python only.
 
 ## Current List of Sorting Algos:
-- [Quick Sort](https://github.com/Zircoz/Sorting-Algorithms-in-Python/blob/master/QuickSort.py)
-- [Selection Sort](https://github.com/Zircoz/Sorting-Algorithms-in-Python/blob/master/Selection_Sort.py)
-- [Insertion Sort](https://github.com/Zircoz/Sorting-Algorithms-in-Python/blob/master/insertion_sort.py)
-- [Merge Sort](https://github.com/Zircoz/Sorting-Algorithms-in-Python/blob/master/merge_sort.py)
-- [Bubble Sort](https://github.com/Zircoz/Sorting-Algorithms-in-Python/blob/master/bubbleSort.py)
-- [Counting Sort](https://github.com/Zircoz/Sorting-Algorithms-in-Python/blob/master/counting_sort.py)
-- [Heap Sort](https://github.com/blackeye735/Sorting-Algorithms-in-Python/blob/master/Heapsort.py)
-- [Bucket Sort](https://github.com/Zircoz/Sorting-Algorithms-in-Python/blob/master/bucket_sort.py)
-- [Tree Sort](https://github.com/Zircoz/Sorting-Algorithms-in-Python/blob/master/tree_sort.py)
+- [Quick Sort](QuickSort.py)
+- [Selection Sort](Selection_Sort.py)
+- [Insertion Sort](insertion_sort.py)
+- [Merge Sort](merge_sort.py)
+- [Bubble Sort](BubbleSort/bubbleSort.py)
+- [Counting Sort](counting_sort.py)
+- [Heap Sort](HeapSort/Heapsort.py)
+- [Bucket Sort](BucketSort/bucket_sort.py)
+- [Tree Sort](tree_sort.py)
+- [Sleep Sort](SleepSort/sleepSort.py)
 
 
 ## Proposed List of Sorting Algos:
diff --git a/SleepSort/README.md b/SleepSort/README.md
new file mode 100644
index 0000000..73b3626
--- /dev/null
+++ b/SleepSort/README.md
@@ -0,0 +1,10 @@
+Sleep sort is a sorting algorithm where 
+* a thread are created for every element in the unsorted list
+* put the thread on sleep for a certian amount of time i.e., if the element is 2, make the thread sleep for 2 units.
+* print the element or store the elment.
+   
+So basically, larger the value longer sleep period for the thread, smaller the value less sleep period for the thread 
+which leads the program to sort the given array.
+
+Source
+[StackExchange](https://softwareengineering.stackexchange.com/a/106356)
diff --git a/SleepSort/sleepSort.md b/SleepSort/sleepSort.md
new file mode 100644
index 0000000..73b3626
--- /dev/null
+++ b/SleepSort/sleepSort.md
@@ -0,0 +1,10 @@
+Sleep sort is a sorting algorithm where 
+* a thread are created for every element in the unsorted list
+* put the thread on sleep for a certian amount of time i.e., if the element is 2, make the thread sleep for 2 units.
+* print the element or store the elment.
+   
+So basically, larger the value longer sleep period for the thread, smaller the value less sleep period for the thread 
+which leads the program to sort the given array.
+
+Source
+[StackExchange](https://softwareengineering.stackexchange.com/a/106356)
diff --git a/SleepSort/sleepSort.py b/SleepSort/sleepSort.py
new file mode 100644
index 0000000..25f1352
--- /dev/null
+++ b/SleepSort/sleepSort.py
@@ -0,0 +1,11 @@
+import threading 
+import time
+  
+def sort(num): 
+    time.sleep(num)
+    print(num, end = ' ') 
+ 
+to_sort = [9,8,7,6,5,4,3,2,1,0]
+for x in to_sort:
+    t = threading.Thread(target=sort, args=(x,))
+    t.start()
\ No newline at end of file