gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Fix comparison between sorting and search (#31149)

Browse Source 
* Fix comparison between sorting and search

* fix: changed much to very
This commit is contained in:
Aditya K Kamath
2019-02-14 05:51:13 +05:30
committed by Randell Dawson
parent 2620693b20
commit c5e7a9aa78
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
guide/english/algorithms/search-algorithms/linear-search/index.md
View File

@ -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: