binary-search asymptotic-complexity linear-search

What is the worst case runtime for Linear search and Binary search?

I believe the worst case asymptotic complexities for Linear search and Binary Search are O(n) and O(lgn) respectively. Am I correct?

Solution

Yes, that's correct. Can you find examples of cases that trigger these run times?

Trying to make word search program in C
lower_bound() in C++
How to find the first smaller element than an integer X in a vector ? (c++)
Does lower_bound() return the same result with reverse iterators of a vector in increasing order vs forward iterators of a vector in decreasing order?
Why does my binary search need an extra comparison? log2(N)+1
Trying to use BinarySearch to search through an ordered array to find all numbers in a given interval
Binary search function is correct but it returns undefined
Finding multiple value positions in a large vector
Find if any number appears more than n/4 times in a sorted array
What am I doing wrong in this question- Search in Rotated Sorted Array...?
how to use index when searched column is not indexed but has the same ordering as the indexed primary key
Maximum Median competitive programming question
Finding "crossover" index with modified binary search algorithm in Python
LeetCode Python Interpreter giving a different answer from local interpreter
Binary Search for year of songs in array of songs
Number of comparison in best, avg and worst case in Binary Search
Why do we use mid = low + (high – low)/2; but not mid = (low/2) +(high /2)?
Optimized on-disk data structure for search with minimal random accesses
Searching for an element in a circular sorted array
binarySearch() misidentifying index value
I'm confused on what I am supposed to do and how I can do it
Binary Search for multiple items within a Range (Log time filter)
How to perform a binary search of several occurrences?
Java Dictionary Searcher
Is there any chance that simplified forms of certain mathematical expressions throw overflow errors while complex ones dont?
Trying to Prove binary search termination with Z3, but Z3 finds an invalid counter example
What is the time complexity of doing two binary searches on an array?
Ceiling of the element in sorted array
Increased run time of binary search when trying to fix IndexError
C: Binary Search and Binary Insertion