Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

Computer Science > Algorithms > Flashcards

Algorithms Flashcards

You may prefer our related Brainscape-certified flashcards:
Biology 101 flashcards
1
Q

Is a problem with time complexity O(n log n ) tractable?

A

Yes, a tractable problem has polynomial time or better

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What time complexity is bubble sort?

A

O(log n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What time complexity is linear search?

A

O(n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What time complexity is merge sort?

A

O(n log n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly

Computer Science (15 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions