Add algorithm design tips (work in progress)

Author: hollance

Algorithm Design.markdown

@@ -0,0 +1,23 @@
+# Algorithm design techniques
+
+What to do when you're faced with a new problem and you need to find an algorithm for it.
+
+### Is it similar to another problem?
+
+One thing I like about [The Algorithm Design Manual](http://www.algorist.com) by Steven Skiena is that it includes a catalog of problems and solutions you can try. 
+
+If you can frame your problem in terms of another, more general problem, then you might be able to use an existing algorithm.
+
+### It's OK to start with brute force
+
+Naive, brute force solutions are often too slow for practical use but they're a good starting point. By writing the brute force solution, you learn to understand what the problem is really all about.
+
+Once you have a brute force implementation you can use that to verify that any improvements you come up with are correct. 
+
+And if you only work with small datasets, then a brute force approach may actually be good enough on its own.
+
+### Divide and conquer
+
+A big problem is often just a whole bunch of much smaller problems.
+
+[More to come here]

README.markdown

@@ -16,6 +16,8 @@ This is a work in progress. More algorithms will be added soon. :-)
 
 [Big-O notation](Big-O Notation.markdown). We often say things like, "This algorithm is **O(n)**." If you don't know what that means, read this first.
 
+[Algorithm design techniques](Algorithm Design.markdown). How do you create your own algorithms?
+
 [How to contribute](How to Contribute.markdown). Report an issue to leave feedback, or submit a pull request. **Suggestions and contributions are welcome!**
 
 ## Where to start?
@@ -130,6 +132,7 @@ Most of the time using just the built-in `Array`, `Dictionary`, and `Set` types
 - Red-Black Tree
 - Splay Tree
 - Threaded Binary Tree
+- [Segment Tree](Segment Tree/). Stores intervals and can answer which intervals (or segments) contain a given point.
 - kd-Tree
 - [Heap](Heap/). A binary tree stored in an array, so it doesn't use pointers. Makes a great priority queue.
 - Fibonacci Heap