Merge pull request kodecocodes#132 from chris-pilcher/under-construction

Under construction

Author: Chris Pilcher

How to Contribute.markdown

@@ -6,7 +6,7 @@ Want to help out with the Swift Algorithm Club? Great!
 
 Take a look at the [list](README.markdown). Any algorithms or data structures that don't have a link yet are up for grabs.
 
-Things marked with :construction: need work.
+Algorithms in the [Under construction](Under Construction.markdown) area are being worked on. Suggestions and feedback is welcome!
 
 New algorithms and data structures are always welcome (even if they aren't on the list).
 

README.markdown

@@ -26,6 +26,8 @@ This is a work in progress. More algorithms will be added soon. :-)
 
 [How to contribute](How to Contribute.markdown). Report an issue to leave feedback, or submit a pull request.
 
+[Under construction](Under Construction.markdown). Algorithms that are under construction. 
+
 ## Where to start?
 
 If you're new to algorithms and data structures, here are a few good ones to start out with:
@@ -74,7 +76,6 @@ Fast sorts:
 
 Special-purpose sorts:
 
-- [Bucket Sort](Bucket Sort/) :construction:
 - [Counting Sort](Counting Sort/)
 - Radix Sort
 - [Topological Sort](Topological Sort/)
@@ -131,7 +132,6 @@ Most of the time using just the built-in `Array`, `Dictionary`, and `Set` types
 - [Queue](Queue/). First-in, first-out!
 - [Deque](Deque/). A double-ended queue.
 - [Priority Queue](Priority Queue). A queue where the most important element is always at the front.
-- [Bounded Priority Queue](Bounded Priority Queue). A queue that is bounded to have a limited number of elements. :construction:
 - [Ring Buffer](Ring Buffer/). Also known as a circular buffer. An array of a certain size that conceptually wraps around back to the beginning.
 
 ### Lists
@@ -144,7 +144,6 @@ Most of the time using just the built-in `Array`, `Dictionary`, and `Set` types
 - [Tree](Tree/). A general-purpose tree structure.
 - [Binary Tree](Binary Tree/). A tree where each node has at most two children.
 - [Binary Search Tree (BST)](Binary Search Tree/). A binary tree that orders its nodes in a way that allows for fast queries.
-- [AVL Tree](AVL Tree/). A binary search tree that balances itself using rotations. :construction:
 - Red-Black Tree
 - Splay Tree
 - Threaded Binary Tree
@@ -154,7 +153,6 @@ Most of the time using just the built-in `Array`, `Dictionary`, and `Set` types
 - Fibonacci Heap
 - Trie
 - B-Tree
-- [Radix Tree](Radix Tree/) :construction:
 
 ### Hashing
 

Under Construction.markdown

@@ -0,0 +1,17 @@
+# Under Construction :construction:
+
+Here you'll find algorithms that are currently under construction. Suggestions and feedback is welcome!
+
+### Special-purpose sorts:
+
+- [Bucket Sort](Bucket Sort/)
+
+### Queues
+
+- [Bounded Priority Queue](Bounded Priority Queue). A queue that is bounded to have a limited number of elements.
+
+### Trees
+
+- [AVL Tree](AVL Tree/). A binary search tree that balances itself using rotations.
+- [Radix Tree](Radix Tree/)
+