Teken aan
Besonderhede van voorbeeld: -356749394663754279
terug
Metadata
Author:
WikiMatrix
Data
English
[en]
Fibonacci search has an average- and worst-case complexity of O(log n) (see Big O notation).
Spanish
[es]
La búsqueda de Fibonacci tiene complejidad O(log(x)) (Ver notación de O Grande).
History
Your action:
Comment
Mark incorrect example
Please enable JavaScript.