@@ -217,49 +217,49 @@ <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a7
217217< p > Main function. </ p >
218218< dl class ="section return "> < dt > Returns</ dt > < dd > 0 on exit </ dd > </ dl >
219219
220- < p class ="definition "> Definition at line < a class ="el " href ="../../d9/d02/linear__search_8cpp_source.html#l00065 "> 65</ a > of file < a class ="el " href ="../../d9/d02/linear__search_8cpp_source.html "> linear_search.cpp</ a > .</ p >
221- < div class ="fragment "> < div class ="line "> < span class ="lineno "> 65</ span > {</ div >
222- < div class ="line "> < span class ="lineno "> 66</ span > < span class ="keywordtype "> int</ span > mode = 0;</ div >
223- < div class ="line "> < span class ="lineno "> 67</ span > </ div >
224- < div class ="line "> < span class ="lineno "> 68</ span > std::cout << < span class ="stringliteral "> "Choose mode\n"</ span > ;</ div >
225- < div class ="line "> < span class ="lineno "> 69</ span > std::cout << < span class ="stringliteral "> "Self-test mode (1), interactive mode (2): "</ span > ;</ div >
220+ < p class ="definition "> Definition at line < a class ="el " href ="../../d9/d02/linear__search_8cpp_source.html#l00068 "> 68</ a > of file < a class ="el " href ="../../d9/d02/linear__search_8cpp_source.html "> linear_search.cpp</ a > .</ p >
221+ < div class ="fragment "> < div class ="line "> < span class ="lineno "> 68</ span > {</ div >
222+ < div class ="line "> < span class ="lineno "> 69</ span > < span class ="keywordtype "> int</ span > mode = 0;</ div >
226223< div class ="line "> < span class ="lineno "> 70</ span > </ div >
227- < div class ="line "> < span class ="lineno "> 71</ span > std::cin >> mode;</ div >
228- < div class ="line "> < span class ="lineno "> 72</ span > </ div >
229- < div class ="line "> < span class ="lineno "> 73</ span > < span class =" keywordflow " > if </ span > (mode == 2) { </ div >
230- < div class ="line "> < span class ="lineno "> 74</ span > < span class =" keywordtype " > int </ span > size = 0 ;</ div >
231- < div class ="line "> < span class ="lineno "> 75</ span > std::cout << < span class =" stringliteral " > "\nEnter the size of the array [in range 1-30 ]: " </ span > ; </ div >
232- < div class ="line "> < span class ="lineno "> 76</ span > std::cin >> size; </ div >
233- < div class ="line "> < span class ="lineno "> 77</ span > </ div >
234- < div class ="line "> < span class ="lineno "> 78</ span > < span class ="keywordflow " > while </ span > ( size <= 0 || size > 30) { </ div >
235- < div class ="line "> < span class ="lineno "> 79</ span > std::cout << < span class =" stringliteral " > "Size can only be 1-30. Please choose another value: " </ span > ;</ div >
236- < div class ="line "> < span class ="lineno "> 80</ span > std::cin >> size; </ div >
237- < div class ="line "> < span class ="lineno "> 81</ span > } </ div >
238- < div class ="line "> < span class ="lineno "> 82</ span > </ div >
239- < div class ="line "> < span class ="lineno "> 83</ span > < span class =" keywordtype " > int </ span > *array = < span class =" keyword " > new </ span > < span class =" keywordtype " > int </ span > [ size] ;</ div >
240- < div class ="line "> < span class ="lineno "> 84</ span > < span class =" keywordtype " > int </ span > key = 0; </ div >
224+ < div class ="line "> < span class ="lineno "> 71</ span > std::cout << < span class =" stringliteral " > "Choose mode\n" </ span > ;</ div >
225+ < div class ="line "> < span class ="lineno "> 72</ span > std::cout << < span class =" stringliteral " > "Self-test mode (1), interactive mode (2): " </ span > ; </ div >
226+ < div class ="line "> < span class ="lineno "> 73</ span > </ div >
227+ < div class ="line "> < span class ="lineno "> 74</ span > std::cin >> mode ;</ div >
228+ < div class ="line "> < span class ="lineno "> 75</ span > </ div >
229+ < div class ="line "> < span class ="lineno "> 76</ span > < span class =" keywordflow " > if </ span > (mode == 2) { </ div >
230+ < div class ="line "> < span class ="lineno "> 77</ span > < span class =" keywordtype " > int </ span > size = 0; </ div >
231+ < div class ="line "> < span class ="lineno "> 78</ span > std::cout << < span class ="stringliteral " > "\nEnter the size of the array [in range 1-30 ]: " </ span > ; </ div >
232+ < div class ="line "> < span class ="lineno "> 79</ span > std::cin >> size ;</ div >
233+ < div class ="line "> < span class ="lineno "> 80</ span > </ div >
234+ < div class ="line "> < span class ="lineno "> 81</ span > < span class =" keywordflow " > while </ span > (size <= 0 || size > 30) { </ div >
235+ < div class ="line "> < span class ="lineno "> 82</ span > std::cout << < span class =" stringliteral " > "Size can only be 1-30. Please choose another value: " </ span > ; </ div >
236+ < div class ="line "> < span class ="lineno "> 83</ span > std::cin >> size;</ div >
237+ < div class ="line "> < span class ="lineno "> 84</ span > } </ div >
241238< div class ="line "> < span class ="lineno "> 85</ span > </ div >
242- < div class ="line "> < span class ="lineno "> 86</ span > < span class ="comment " > // Input for the array elements < /span > </ div >
243- < div class ="line "> < span class ="lineno "> 87</ span > std::cout << < span class ="stringliteral " > "Enter the array of " </ span > << size << < span class =" stringliteral " > " numbers: " </ span > ;</ div >
244- < div class ="line "> < span class ="lineno "> 88</ span > < span class =" keywordflow " > for </ span > ( < span class =" keywordtype " > int </ span > i = 0; i < size; i++) { </ div >
245- < div class ="line "> < span class ="lineno "> 89</ span > std::cin >> array[i]; </ div >
246- < div class ="line "> < span class ="lineno "> 90</ span > } </ div >
247- < div class ="line "> < span class ="lineno "> 91</ span > </ div >
248- < div class ="line "> < span class ="lineno "> 92</ span > std::cout << < span class =" stringliteral " > "\nEnter the number to be searched: " </ span > ;</ div >
249- < div class ="line "> < span class ="lineno "> 93</ span > std::cin >> key; </ div >
239+ < div class ="line "> < span class ="lineno "> 86</ span > < span class ="keywordtype " > int </ span > *array = < span class =" keyword " > new </ span > < span class =" keywordtype " > int < /span > [size]; </ div >
240+ < div class ="line "> < span class ="lineno "> 87</ span > < span class ="keywordtype " > int </ span > key = 0 ;</ div >
241+ < div class ="line "> < span class ="lineno "> 88</ span > </ div >
242+ < div class ="line "> < span class ="lineno "> 89</ span > < span class =" comment " > // Input for the array elements </ span > </ div >
243+ < div class ="line "> < span class ="lineno "> 90</ span > std::cout << < span class =" stringliteral " > "Enter the array of " </ span > << size << < span class =" stringliteral " > " numbers: " </ span > ; </ div >
244+ < div class ="line "> < span class ="lineno "> 91</ span > < span class =" keywordflow " > for </ span > ( < span class =" keywordtype " > int </ span > i = 0; i < size; i++) { </ div >
245+ < div class ="line "> < span class ="lineno "> 92</ span > std::cin >> array[i] ;</ div >
246+ < div class ="line "> < span class ="lineno "> 93</ span > } </ div >
250247< div class ="line "> < span class ="lineno "> 94</ span > </ div >
251- < div class ="line "> < span class ="lineno "> 95</ span > < span class ="keywordtype "> int</ span > index = < a class ="code hl_function " href ="#a84ac3988a534eb60ca351ed6caf56d84 "> LinearSearch</ a > (array, size, key);</ div >
252- < div class ="line "> < span class ="lineno "> 96</ span > < span class ="keywordflow "> if</ span > (index != -1) {</ div >
253- < div class ="line "> < span class ="lineno "> 97</ span > std::cout << < span class ="stringliteral "> "Number found at index: "</ span > << index << < span class ="stringliteral "> "\n"</ span > ;</ div >
254- < div class ="line "> < span class ="lineno "> 98</ span > } < span class ="keywordflow "> else</ span > {</ div >
255- < div class ="line "> < span class ="lineno "> 99</ span > std::cout << < span class ="stringliteral "> "Array element not found"</ span > ;</ div >
256- < div class ="line "> < span class ="lineno "> 100</ span > }</ div >
257- < div class ="line "> < span class ="lineno "> 101</ span > < span class ="keyword "> delete</ span > [] array;</ div >
258- < div class ="line "> < span class ="lineno "> 102</ span > } < span class ="keywordflow "> else</ span > {</ div >
259- < div class ="line "> < span class ="lineno "> 103</ span > < a class ="code hl_function " href ="#a483bb8ccf42aaf7375a83e91490eda1e "> tests</ a > (); < span class ="comment "> // run self-test implementations</ span > </ div >
260- < div class ="line "> < span class ="lineno "> 104</ span > }</ div >
261- < div class ="line "> < span class ="lineno "> 105</ span > < span class ="keywordflow "> return</ span > 0;</ div >
262- < div class ="line "> < span class ="lineno "> 106</ span > }</ div >
248+ < div class ="line "> < span class ="lineno "> 95</ span > std::cout << < span class ="stringliteral "> "\nEnter the number to be searched: "</ span > ;</ div >
249+ < div class ="line "> < span class ="lineno "> 96</ span > std::cin >> key;</ div >
250+ < div class ="line "> < span class ="lineno "> 97</ span > </ div >
251+ < div class ="line "> < span class ="lineno "> 98</ span > < span class ="keywordtype "> int</ span > index = < a class ="code hl_function " href ="#a84ac3988a534eb60ca351ed6caf56d84 "> LinearSearch</ a > (array, size, key);</ div >
252+ < div class ="line "> < span class ="lineno "> 99</ span > < span class ="keywordflow "> if</ span > (index != -1) {</ div >
253+ < div class ="line "> < span class ="lineno "> 100</ span > std::cout << < span class ="stringliteral "> "Number found at index: "</ span > << index << < span class ="stringliteral "> "\n"</ span > ;</ div >
254+ < div class ="line "> < span class ="lineno "> 101</ span > } < span class ="keywordflow "> else</ span > {</ div >
255+ < div class ="line "> < span class ="lineno "> 102</ span > std::cout << < span class ="stringliteral "> "Array element not found"</ span > ;</ div >
256+ < div class ="line "> < span class ="lineno "> 103</ span > }</ div >
257+ < div class ="line "> < span class ="lineno "> 104</ span > < span class ="keyword "> delete</ span > [] array;</ div >
258+ < div class ="line "> < span class ="lineno "> 105</ span > } < span class ="keywordflow "> else</ span > {</ div >
259+ < div class ="line "> < span class ="lineno "> 106</ span > < a class ="code hl_function " href ="#a483bb8ccf42aaf7375a83e91490eda1e "> tests</ a > (); < span class ="comment "> // run self-test implementations</ span > </ div >
260+ < div class ="line "> < span class ="lineno "> 107</ span > }</ div >
261+ < div class ="line "> < span class ="lineno "> 108</ span > < span class ="keywordflow "> return</ span > 0;</ div >
262+ < div class ="line "> < span class ="lineno "> 109</ span > }</ div >
263263< div class ="ttc " id ="alinear__search_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e "> < div class ="ttname "> < a href ="#a483bb8ccf42aaf7375a83e91490eda1e "> tests</ a > </ div > < div class ="ttdeci "> static void tests()</ div > < div class ="ttdoc "> Self-test implementations.</ div > < div class ="ttdef "> < b > Definition</ b > < a href ="../../d9/d02/linear__search_8cpp_source.html#l00037 "> linear_search.cpp:37</ a > </ div > </ div >
264264< div class ="ttc " id ="alinear__search_8cpp_html_a84ac3988a534eb60ca351ed6caf56d84 "> < div class ="ttname "> < a href ="#a84ac3988a534eb60ca351ed6caf56d84 "> LinearSearch</ a > </ div > < div class ="ttdeci "> int LinearSearch(int *array, int size, int key)</ div > < div class ="ttdoc "> for IO operations</ div > < div class ="ttdef "> < b > Definition</ b > < a href ="../../d9/d02/linear__search_8cpp_source.html#l00021 "> linear_search.cpp:21</ a > </ div > </ div >
265265</ div > <!-- fragment -->
@@ -303,18 +303,21 @@ <h2 class="memtitle"><span class="permalink"><a href="#a483bb8ccf42aaf7375a83e91
303303< div class ="line "> < span class ="lineno "> 45</ span > assert(< a class ="code hl_function " href ="#a84ac3988a534eb60ca351ed6caf56d84 "> LinearSearch</ a > (array, size, 1) == 1);</ div >
304304< div class ="line "> < span class ="lineno "> 46</ span > assert(< a class ="code hl_function " href ="#a84ac3988a534eb60ca351ed6caf56d84 "> LinearSearch</ a > (array, size, 2) == 2);</ div >
305305< div class ="line "> < span class ="lineno "> 47</ span > </ div >
306- < div class ="line "> < span class ="lineno "> 48</ span > size = 6;</ div >
307- < div class ="line "> < span class ="lineno "> 49</ span > < span class ="keywordflow "> for</ span > (< span class ="keywordtype "> int</ span > i = 0; i < size; i++) {</ div >
308- < div class ="line "> < span class ="lineno "> 50</ span > array[i] = i;</ div >
309- < div class ="line "> < span class ="lineno "> 51</ span > }</ div >
310- < div class ="line "> < span class ="lineno "> 52</ span > </ div >
311- < div class ="line "> < span class ="lineno "> 53</ span > assert(< a class ="code hl_function " href ="#a84ac3988a534eb60ca351ed6caf56d84 "> LinearSearch</ a > (array, size, 3) == 3);</ div >
312- < div class ="line "> < span class ="lineno "> 54</ span > assert(< a class ="code hl_function " href ="#a84ac3988a534eb60ca351ed6caf56d84 "> LinearSearch</ a > (array, size, 1) == 1);</ div >
313- < div class ="line "> < span class ="lineno "> 55</ span > assert(< a class ="code hl_function " href ="#a84ac3988a534eb60ca351ed6caf56d84 "> LinearSearch</ a > (array, size, 5) == 5);</ div >
314- < div class ="line "> < span class ="lineno "> 56</ span > </ div >
315- < div class ="line "> < span class ="lineno "> 57</ span > std::cout << < span class ="stringliteral "> "All tests have successfully passed!\n"</ span > ;</ div >
316- < div class ="line "> < span class ="lineno "> 58</ span > < span class ="keyword "> delete</ span > [] array; < span class ="comment "> // free memory up</ span > </ div >
317- < div class ="line "> < span class ="lineno "> 59</ span > }</ div >
306+ < div class ="line "> < span class ="lineno "> 48</ span > < span class ="keyword "> delete</ span > [] array;</ div >
307+ < div class ="line "> < span class ="lineno "> 49</ span > </ div >
308+ < div class ="line "> < span class ="lineno "> 50</ span > size = 6;</ div >
309+ < div class ="line "> < span class ="lineno "> 51</ span > array = < span class ="keyword "> new</ span > < span class ="keywordtype "> int</ span > [size];</ div >
310+ < div class ="line "> < span class ="lineno "> 52</ span > < span class ="keywordflow "> for</ span > (< span class ="keywordtype "> int</ span > i = 0; i < size; i++) {</ div >
311+ < div class ="line "> < span class ="lineno "> 53</ span > array[i] = i;</ div >
312+ < div class ="line "> < span class ="lineno "> 54</ span > }</ div >
313+ < div class ="line "> < span class ="lineno "> 55</ span > </ div >
314+ < div class ="line "> < span class ="lineno "> 56</ span > assert(< a class ="code hl_function " href ="#a84ac3988a534eb60ca351ed6caf56d84 "> LinearSearch</ a > (array, size, 3) == 3);</ div >
315+ < div class ="line "> < span class ="lineno "> 57</ span > assert(< a class ="code hl_function " href ="#a84ac3988a534eb60ca351ed6caf56d84 "> LinearSearch</ a > (array, size, 1) == 1);</ div >
316+ < div class ="line "> < span class ="lineno "> 58</ span > assert(< a class ="code hl_function " href ="#a84ac3988a534eb60ca351ed6caf56d84 "> LinearSearch</ a > (array, size, 5) == 5);</ div >
317+ < div class ="line "> < span class ="lineno "> 59</ span > </ div >
318+ < div class ="line "> < span class ="lineno "> 60</ span > std::cout << < span class ="stringliteral "> "All tests have successfully passed!\n"</ span > ;</ div >
319+ < div class ="line "> < span class ="lineno "> 61</ span > < span class ="keyword "> delete</ span > [] array; < span class ="comment "> // free memory up</ span > </ div >
320+ < div class ="line "> < span class ="lineno "> 62</ span > }</ div >
318321</ div > <!-- fragment -->
319322</ div >
320323</ div >
0 commit comments