algorithm - Determining the big-O runtimes of these - Wikitechy

algorithm - Determining the big-O runtimes of these - Wikitechy https://www.wikitechy.com/interview-questions/tag/algorithm-determining-the-big-o-runtimes-of-these/ Interview Questions Fri, 03 Sep 2021 06:36:30 +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 algorithm - Determining the big-O runtimes of these - Wikitechy https://www.wikitechy.com/interview-questions/tag/algorithm-determining-the-big-o-runtimes-of-these/ 32 32 A code with θ(n) and θ(n2) complexity. Which code will execute faster for a code of size J ? https://www.wikitechy.com/interview-questions/programming/a-code-with-%ce%b8n-and-%ce%b8n2-complexity-which-code-will-execute-faster-for-a-code-of-size-j/ https://www.wikitechy.com/interview-questions/programming/a-code-with-%ce%b8n-and-%ce%b8n2-complexity-which-code-will-execute-faster-for-a-code-of-size-j/#respond Fri, 27 Aug 2021 00:49:36 +0000 https://www.wikitechy.com/interview-questions/?p=2590

A code with θ(n) and θ(n²) complexity . Which code will execute faster for a code of size J ?

A. θ(n)

B. θ(n²)

C. Cant be said as size of K is unknown

D. Both will be equal

Answer : C. Cant be said as size of K is unknown

Explanation :

Cant be determined as the size of K is not known.

]]> https://www.wikitechy.com/interview-questions/programming/a-code-with-%ce%b8n-and-%ce%b8n2-complexity-which-code-will-execute-faster-for-a-code-of-size-j/feed/ 0