<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>How to analyse time complexity - Wikitechy</title>
	<atom:link href="https://www.wikitechy.com/interview-questions/tag/how-to-analyse-time-complexity/feed/" rel="self" type="application/rss+xml" />
	<link>https://www.wikitechy.com/interview-questions/tag/how-to-analyse-time-complexity/</link>
	<description>Interview Questions</description>
	<lastBuildDate>Fri, 03 Sep 2021 06:34:37 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=6.9.4</generator>

<image>
	<url>https://www.wikitechy.com/interview-questions/wp-content/uploads/2025/10/cropped-wikitechy-icon-32x32.png</url>
	<title>How to analyse time complexity - Wikitechy</title>
	<link>https://www.wikitechy.com/interview-questions/tag/how-to-analyse-time-complexity/</link>
	<width>32</width>
	<height>32</height>
</image> 
	<item>
		<title>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 ?</title>
		<link>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/</link>
					<comments>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</comments>
		
		<dc:creator><![CDATA[Editor]]></dc:creator>
		<pubDate>Fri, 27 Aug 2021 00:51:34 +0000</pubDate>
				<category><![CDATA[Programming]]></category>
		<category><![CDATA[a flower pot is kept]]></category>
		<category><![CDATA[c - How do I find the time complexity (Big O)]]></category>
		<category><![CDATA[c - Time complexity analysis in finding index]]></category>
		<category><![CDATA[Finding time complexity of algorithms using big-O]]></category>
		<category><![CDATA[How to analyse time complexity]]></category>
		<category><![CDATA[how to calculate time complexity for a given algorithm]]></category>
		<category><![CDATA[how to calculate time complexity of a program in c]]></category>
		<category><![CDATA[how to calculate time complexity of nested loops]]></category>
		<category><![CDATA[How to find time complexity of an algorithm]]></category>
		<category><![CDATA[how to reduce time complexity of for loop]]></category>
		<category><![CDATA[java - What is time complexity and how to find it]]></category>
		<category><![CDATA[Most Asked Sapient Nitro Interview Questions]]></category>
		<category><![CDATA[There are 2 buildings and on each’s window]]></category>
		<category><![CDATA[Time and Space Complexity]]></category>
		<category><![CDATA[time complexity analysis]]></category>
		<category><![CDATA[time complexity calculation examples]]></category>
		<category><![CDATA[time complexity examples]]></category>
		<category><![CDATA[time complexity of algorithms]]></category>
		<category><![CDATA[time complexity of algorithms examples]]></category>
		<category><![CDATA[time complexity tutorial]]></category>
		<guid isPermaLink="false">https://www.wikitechy.com/interview-questions/?p=2591</guid>

					<description><![CDATA[Answer : D. Theta(n2)]]></description>
										<content:encoded><![CDATA[<div class="TextHeading">
<div class="hddn">
<p class="color-pink">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 ?</p>
<div class="row">
<div class="col-sm-6">
<p>A. Omega(n)</p>
</div>
<div class="col-sm-6">
<p>B. Omega(n<sup>2</sup>)</p>
</div>
<div class="col-sm-6">
<p>C. Theta (n)</p>
</div>
<div class="col-sm-6">
<p>D. Theta (n<sup>2</sup>)</p>
</div>
</div>
</div>
</div>
<h3 id="answer-d-thetan2"><b>Answer : </b>D. Theta(n<sup>2</sup>)</h3>
<div class="TextHeading">
<div class="hddn">
<h2 id="explanation">Explanation:</h2>
</div>
</div>
<div class="Content">
<div class="hddn">
<ul>
<li>The multiplication involved will use two for loops and hence the complexity will be Theta(n<sup>2</sup>)</li>
</ul>
</div>
</div>
]]></content:encoded>
					
					<wfw:commentRss>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/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
	</channel>
</rss>
