From 354043752c16f6fff52c2f4a431e244332f1bc4b Mon Sep 17 00:00:00 2001
From: sourya <38237352+sourybunny@users.noreply.github.com>
Date: Tue, 22 Jan 2019 01:08:45 +0530
Subject: [PATCH] add appropriate title "algorithm performance" (#30585)

---
 guide/english/algorithms/algorithm-performance/index.md | 5 +++++
 1 file changed, 5 insertions(+)

diff --git a/guide/english/algorithms/algorithm-performance/index.md b/guide/english/algorithms/algorithm-performance/index.md
index 4c868ba6c4..f85a4a2ddb 100644
--- a/guide/english/algorithms/algorithm-performance/index.md
+++ b/guide/english/algorithms/algorithm-performance/index.md
@@ -2,6 +2,11 @@
 title: Algorithm Performance
 ---
 
+## Algorithm Performance
+To understand the performance of algorithms, first we need to know the big-O notation.
+
+### The Big-O Notation
+####
 In mathematics, big-O notation is a symbolism used to describe and compare the _limiting behavior_ of a function.  
 
 A function's limiting behavior is how the function acts as it approaches a specific value (usually trends towards infinity).