<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Time complexity - Page 6 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=time_complexity&amp;p=5">1.Previous</a><br />
<a accesskey="3" href="page.php?w=time_complexity&amp;p=7">3.Next</a>
</p>
<p>a specific element in an <a href="page.php?w=array_data_structure">array</a> is a constant-time operation, as it requires only a single operation to locate that element.</p>

<p>In contrast, determining the minimum value in an unordered array is not constant time; it requires examining each <a href="page.php?w=element_%28math%29">element</a>, resulting in linear time complexity, or . However, if the number of elements is known and fixed, certain tasks can still be considered constant time.</p>

<p>Importantly, the term "constant time" does not</p><p>
<a accesskey="1" href="page.php?w=time_complexity&amp;p=5">1.Previous</a><br />
<a accesskey="3" href="page.php?w=time_complexity&amp;p=7">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
