Big O of Data Structures Flashcards
1
Q
What is the Big O of accessing data in an array?
A
O( 1 )
2
Q
What is the Big O of searching for data for an array?
A
O( n )
3
Q
What is the Big O of Inserting into an array?
A
O( n )
4
Q
What is the Big O of Deletion in an array?
A
O( n )
5
Q
What is the Big O of accessing data in an stack?
A
O( n )
6
Q
What is the Big O of searching for data for an stack?
A
O( n )
7
Q
What is the Big O of Inserting into an stack?
A
O( 1 )
8
Q
What is the Big O of Deletion in an stack?
A
O( 1 )
9
Q
What is the Big O of accessing data in an queue?
A
O( n )
10
Q
What is the Big O of searching for data for an queue?
A
O( n )
11
Q
What is the Big O of Inserting into an queue?
A
O( 1 )
12
Q
What is the Big O of Deletion in an queue?
A
O( 1 )
