sequential_search_finding_max_value

sequential_search_finding_max_value - return 0 } /* linear...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Sheet1 Page 1 #include <iostream> using namespace std int main() { int num[5] = {0} int i = 0 for (i = 0 { cin >> num[i] } int maxPos = 0 int maxValue = -2000000000 for (i = 0 { //cout << "current strength is " << num[i] << endl //cout << "max value so far is " << maxValue << endl if (num[i] > maxValue ) { //cout << "new champion in position " << i << endl maxPos = i maxValue = num[i] } } cout << "The max value is " << maxValue << " in position " << maxPos + 1 << endl
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: return 0 } /* linear search - looking for 15 int spot = -1 for (i = 0 { if (num[i] == 15) { spot = i break } } if (spot != -1) cout &lt;&lt; spot + 1 &lt;&lt; endl else cout &lt;&lt; &quot;Not found&quot; &lt;&lt; endl */ Sheet1 Page 2 i &lt; 5 i++) i &lt; 5 i++) i &lt; 5 i++) // adding one to account for 0-based array...
View Full Document

Page1 / 2

sequential_search_finding_max_value - return 0 } /* linear...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online