Pergunta de entrevista da empresa Netsmartz
Q: Time Complexity of Binary search in worst case.
Resposta da entrevista
Sigiloso
4 de abr. de 2025
The worst-case time complexity of a binary search is O(log n)
Q: Time Complexity of Binary search in worst case.
Sigiloso
The worst-case time complexity of a binary search is O(log n)