Skip to content

I created this repo to make comparisons between linear search and binary search.

Notifications You must be signed in to change notification settings

gcmonteiro02/binary-linear-search-comparison

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

1 Commit
 
 
 
 

Repository files navigation

Linear search x Binary Search

I created this repository to ensure the differences between linear search and binary search that i learned in the book called Grokking Algorithms. It's my first project using python.

It is known by everyone in the field of programming that binary search is much faster than linear search. This happens because the complexity of the binary search is calculated by O(log n) while the linear search is calculated by O(n).

It is simple and only intended to register a study.

About

I created this repo to make comparisons between linear search and binary search.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages