update titles

Author: csabapalfi

Diff for: 1.3-correctness.md

@@ -1,7 +1,4 @@
----
-layout: post
-title: Reasoning about Correctness
----
+# Reasoning about Correctness
 
 ## An algorithm
 

Diff for: 1.4-modeling.md

@@ -1,7 +1,4 @@
----
-layout: post
-title: Modeling the Problem
----
+# Modeling the Problem
 
 * modeling translates a real-world application into an abstract model which consists of procedures on fundamental structures
 * a precisely described model allow you to re-use well-understood solutions from algorithms literature

Diff for: 2.1-algorithm_analysis.md

@@ -1,7 +1,4 @@
----
-layout: post
-title: Algorithm analysis
----
+# Algorithm analysis
 
 Algorithms can be understood and studied in a language- and machine-independent manner. We want to compare the efficiency of algorithms without implementing them.
 Two tools for this are the **RAM model of computation** and **asymptotic analysis of worst-case complexity (big Oh)**

Diff for: 2.2-the_big_oh_notation.md

@@ -1,7 +1,4 @@
----
-layout: post
-title: The Big Oh notation
----
+# The Big Oh notation
 
 It's difficult to work directly with the time complexity functions as they tend to:
 * have too many bumps (e.g. some problems size is nicely in favor)

Diff for: 2.3-dominance_relations.md

@@ -1,7 +1,4 @@
----
-layout: post
-title: Growth Rates and Dominance Relations
----
+# Growth Rates and Dominance Relations
 
 ## Growth rates
 

Diff for: 2.6-logarithms.md

@@ -1,7 +1,4 @@
----
-layout: post
-title: Logarithms
----
+# Logarithms
 
 * a logarithm is simply an inverse exponential function
 * b^x=y => x=log(y) where the base of the logarithm is b

Diff for: 3.1-arrays_and_linked_lists.md

@@ -1,7 +1,4 @@
----
-layout: post
-title: Arrays and linked lists
----
+# Arrays and linked lists
 
 * abstract data types: container (stack, queue), dictionary, priority queue
 * common data structures than can be used to implement them: arrays or linked lists and so on

Diff for: 3.2-stacks_and_queues.md

@@ -1,7 +1,4 @@
----
-layout: post
-title: Stacks and queues
----
+# Stacks and queues
 
 ## Containers
 

Diff for: 3.3-dictionaries.md

@@ -1,7 +1,4 @@
----
-layout: post
-title: Dictionaries
----
+# Dictionaries
 
 * the dictionary abstract data type permits access to data items by content
 * items added to a dictionary can be found by their key

Diff for: 3.4-binary_search_trees.md

@@ -1,7 +1,4 @@
----
-layout: post
-title: Binary search trees
----
+# Binary search trees
 
 * doubly-linked lists supported insertion and deletion in O(1) but linear query time
 * sorted lists support logarithmic query time but linear time update

Diff for: 3.5-priority_queues.md

@@ -1,5 +1,2 @@
----
-layout: post
-title: Priority queues
----
+# Priority queues