https://algorist.com/algowiki_v2/index.php?action=history&feed=atom&title=TADM2E_2.6TADM2E 2.6 - Revision history2026-05-01T05:38:47ZRevision history for this page on the wikiMediaWiki 1.28.0https://algorist.com/algowiki_v2/index.php?title=TADM2E_2.6&diff=97&oldid=prevAlgowikiadmin: Recovering wiki2014-09-11T18:14:12Z<p>Recovering wiki</p>
<p><b>New page</b></p><div>'''n = 1''' <br />
The single element array is already its max. Loop is not entered. Max is returned<br />
<br />
Let for '''n=k''', the algorithm is true<br />
<br />
For '''n = k+1''' ,two cases arise :<br />
<br />
'''1)''' a[k+1] is max <br />
<br />
'''2)''' a[k+1] is not max.<br />
<br />
If '''1)''' holds then at the last iteration when i = k+1, m = a[k+1] is assigned. Hence max is returned<br />
<br />
Else if '''2)''' holds then we are left with the task of finding the max among '''n = k''' elements, which we already assumed that the algorithm does correctly.</div>Algowikiadmin