time complexity of algorithms - Wikitechy https://www.wikitechy.com/interview-questions/tag/time-complexity-of-algorithms/ Interview Questions Mon, 13 Sep 2021 10:33:04 +0000 en-US hourly 1 https://wordpress.org/?v=6.9.4 https://www.wikitechy.com/interview-questions/wp-content/uploads/2025/10/cropped-wikitechy-icon-32x32.png time complexity of algorithms - Wikitechy https://www.wikitechy.com/interview-questions/tag/time-complexity-of-algorithms/ 32 32 There are 2 buildings and on each’s window, a flower pot is kept. Ravi’s mother tells him to multiply each cell/window to the other and store in a matrix ? What would be time complexity if he writes a code to do so ? https://www.wikitechy.com/interview-questions/programming/there-are-2-buildings-and-on-eachs-window-a-flower-pot-is-kept-ravis-mother-tells-him-to-multiply-each-cell-window-to-the-other-and-store-in-a-matrix-what-would-be-time-complexit/ https://www.wikitechy.com/interview-questions/programming/there-are-2-buildings-and-on-eachs-window-a-flower-pot-is-kept-ravis-mother-tells-him-to-multiply-each-cell-window-to-the-other-and-store-in-a-matrix-what-would-be-time-complexit/#respond Fri, 27 Aug 2021 00:51:34 +0000 https://www.wikitechy.com/interview-questions/?p=2591

There are 2 buildings and on each’s window, a flower pot is kept. Ravi’s mother tells him to multiply each cell/window to the other and store in a matrix ? What would be time complexity if he writes a code to do so ?

A. Omega(n)

B. Omega(n2)

C. Theta (n)

D. Theta (n2)

Answer : D. Theta(n2)

Explanation:

  • The multiplication involved will use two for loops and hence the complexity will be Theta(n2)
]]> https://www.wikitechy.com/interview-questions/programming/there-are-2-buildings-and-on-eachs-window-a-flower-pot-is-kept-ravis-mother-tells-him-to-multiply-each-cell-window-to-the-other-and-store-in-a-matrix-what-would-be-time-complexit/feed/ 0 Which of the following has the quickest average time complexity ? https://www.wikitechy.com/interview-questions/data-structure/which-of-the-following-has-the-quickest-average-time-complexity/ https://www.wikitechy.com/interview-questions/data-structure/which-of-the-following-has-the-quickest-average-time-complexity/#respond Tue, 13 Jul 2021 11:03:11 +0000 https://www.wikitechy.com/interview-questions/?p=470

Which of the following has the quickest average time complexity ?

A. Quick

B. Radix

C. Bubble

D. Heap

Answer : B. Radix

Explanation :

Radix sort is quickest amongst these in average time.Average Time Complexiy

]]> https://www.wikitechy.com/interview-questions/data-structure/which-of-the-following-has-the-quickest-average-time-complexity/feed/ 0 In regards to time complexity which will perform better ω(n4) or O(n3) ? https://www.wikitechy.com/interview-questions/data-structure/in-regards-to-time-complexity-which-will-perform-better-%cf%89n4-or-on3/ https://www.wikitechy.com/interview-questions/data-structure/in-regards-to-time-complexity-which-will-perform-better-%cf%89n4-or-on3/#respond Tue, 13 Jul 2021 10:55:39 +0000 https://www.wikitechy.com/interview-questions/?p=466

In regards to time complexity which will perform better ω(n4) or O(n3) ?

A. ω(n4)

B. O(n3)

C. Both Equally

D. Can’t be said

Answer : A. ω(n4)

Explanation :

  • O indicates the worst case complexity of an algorithm
  • ω indicates the best case complexity of an algorithm
]]> https://www.wikitechy.com/interview-questions/data-structure/in-regards-to-time-complexity-which-will-perform-better-%cf%89n4-or-on3/feed/ 0