Linear search is a searching algorithm that sequentially checks each element in a list until the desired element is found or the sequence ends.
- Best Case: O(1) (Element found at the beginning)
- Worst Case: O(n) (Element at the end or not present)
-
Notifications
You must be signed in to change notification settings - Fork 0
License
toramanomer/typescript-algorithms
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description or website provided.
Topics
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published