Skip to main content
Engineering LibreTexts

21.3: Practice 20 More Array Functions

  • Page ID
    10536
  • \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \) \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)\(\newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\) \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\) \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\) \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\) \( \newcommand{\Span}{\mathrm{span}}\) \(\newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\) \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\) \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\) \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\) \( \newcommand{\Span}{\mathrm{span}}\)\(\newcommand{\AA}{\unicode[.8,0]{x212B}}\)

    Learning Objectives

    With 100% accuracy during a: memory building activity, exercises, lab assignment, problems, or timed quiz/exam; the student is expected to:

    Define the terms on the definitions as listed in the modules associated with this chapter.

    Within C++ source code be able to understand functions for arrays, specifically searching a array's values to see if a given value exists, finding the maximum value in an array and sorting an array.

    Within C++ source code be able to create functions for arrays, specifically a function for finding the smallest value in an array.

    Within C++ source code be able to modifying existing code to process different types of arrays.

    Memory Building Activities

    Link to: MBA 20

    Exercises

    Questions
        1. Linear searches require complex algorithms.
        2. Functions are often created for searching for the max and min values in an array.
        3. The bubble sort is an easy way to arrange data an array.
        4. There is only one method of bubble sorting.
        5. Sorting an array is frequently done.
    Answers
        1. False
        2. True
        3. True
        4. False
        5. True
    

    Lab Assignment

    Creating a Folder or Sub-Folder for Chapter 20 Files

    Depending on your compiler/IDE, you should decide where to download and store source code files for processing. Prudence dictates that you create these folders as needed prior to downloading source code files. A suggested sub-folder for the Bloodshed Dev-C++ 5 compiler/IDE might be named:

    • Chapter_20 within the folder named: Cpp_Source_Code_Files

    If you have not done so, please create the folder(s) and/or sub-folder(s) as appropriate.

    Download the Lab File(s)

    Download and store the following file(s) to your storage device in the appropriate folder(s). You may need to right click on the link and select "Save Target As" in order to download the file.

    Download from Connexions: Lab_20_Narrative_Description.txt

    Detailed Lab Instructions

    Read and follow the directions below carefully, and perform the steps in the order listed.

    • Create a source code file following the directions in the Lab_20_Narrative_Description.txt file. Name it: Lab_20.cpp
    • Build (compile and run) your program.
    • After you have successfully written this program, if you are taking this course for college credit, follow the instructions from your professor/instructor for submitting it for grading.

    Problems

    Problem 20a - Instructions

    Give a short explanation of bubble sorting.


    This page titled 21.3: Practice 20 More Array Functions is shared under a CC BY license and was authored, remixed, and/or curated by Kenneth Leroy Busbee (OpenStax CNX) .

    • Was this article helpful?