BANK SEBI Grade A Phase 1 & Phase 2 Mock Test 2024 Algorithms Asymptotic Worst Case Time and Time Complexity Introduction

An algorithm with three nested loops will have a Big-O efficiency of (a size on n).

1
O(n3)
2
O(3n)
3
O(n4)
4
O(n2)
5
O(n)
Share: WhatsApp Telegram X

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Other Tools: chatwiz.hivanix.in mmspace.hivanix.in unogame.hivanix.in

Quick Navigation

Home

Subjects

Chapters