Flashcards
Time Complexity
Cards in this deck (5)
- 1Linear searchO(n)
- 2Binary SearchO(log n)
Working out: start with n/(2^x) = 1 - 3Binary Tree SearchO(log n)
- 4Bubble SortO(n^2)
- 5Merge SortO(nlog n)
Information
- Description
- A level Computing Flashcards on Time Complexity, created by Peter Davison on 02/06/2019.
- Created by
- Peter Davison
- Views
- 1
- Rating