diff --git a/README.md b/README.md
index 6eebdb9d1c5e119c33bdd0ff47ed0de00bc630d3..470e51664731e7c880181a13108f21c42c0de681 100644
--- a/README.md
+++ b/README.md
@@ -32,3 +32,42 @@ like this:
 
 When writing your code, be sure to utilize proper object-oriented
 techniques and design. Show appropriate use of class construction.
+
+------
+Analysis, thoughts:
+
+most contiguous
+	walk cuts maintaining high count
+	High = 1
+	Count = 1
+	if next is same then increase Count and if greater than high increase High
+	When differnt Count goes back to 1
+	when all values processed High will contain the highest contiguous
+least contiguous
+	walk cuts maintainng low count
+	Low is length
+	Count = 1 
+	if next is same then increase Count 
+	When differnt if Count < Low then Low = Count and Count goes back to 1
+	when all values processed low will contain the lowest contiguous
+most present
+	walk cuts creating hash=> count
+	each number creates a hash of 1 or increases the existing hash by 1
+	when done compare the hash values for the highest 
+least present
+	walk cuts creating hash=> count
+	each number creates a hash of 1 or increases the existing hash by 1
+	when done compare the hash values for the lowest 
+max adjacent
+	walk cuts maintaining High macs
+	High = 0 
+	Current = difference between current and previous cut
+	If Current > High then update high
+	advance to next cut until complete
+min adjacent
+	walk cuts maintaining Low macs
+	Low = (difference first two cuts) 
+	Current = difference between current and previous cut
+	If Current < Low then update Low
+	advance to next cut until complete
+