From c5e7a9aa78eb083ac9838e0e2a46dfc5a27b2dee Mon Sep 17 00:00:00 2001
From: Aditya K Kamath <12785368+AKKamath@users.noreply.github.com>
Date: Thu, 14 Feb 2019 05:51:13 +0530
Subject: [PATCH] Fix comparison between sorting and search (#31149)

* Fix comparison between sorting and search

* fix: changed much to very
---
 .../english/algorithms/search-algorithms/linear-search/index.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/guide/english/algorithms/search-algorithms/linear-search/index.md b/guide/english/algorithms/search-algorithms/linear-search/index.md
index 47db9469f5..fd5e2189a0 100644
--- a/guide/english/algorithms/search-algorithms/linear-search/index.md
+++ b/guide/english/algorithms/search-algorithms/linear-search/index.md
@@ -188,7 +188,7 @@ end
 
 ## Why linear search is not efficient
 
-There is no doubt that linear search is simple but because it compares each element one by one, it is time consuming and hence not much efficient. If we have to find a number from say, 1000000 numbers and number is at the last location, linear search technique would become quite tedious. So, also learn about bubble sort, quick sort,etc. which are much more efficient than linear search.
+There is no doubt that linear search is simple but because it compares each element one by one, it is time consuming and hence not very efficient. If we have to find a number from say, 1000000 numbers and number is at the last location, linear search technique would become quite tedious. So, also learn about binary search, exponential search, etc. which are much more efficient than linear search.
 
 #### Relevant Video: