C++

Lab Exercise 2-Bubble Sort ame: Date: Section: This problem is intended to be solved in a closed-lab session with a teaching assistant or instructor present. The problem is divided into six parts: 1. Lab Objectives 2. Description of the Problem 3. Sample Output 4. Program Template (Fig. L7.3-Fig. L7.4) 5. Problem-Solving Tips 6. Follow-Up Question and Activity The program template represents a complete working C++program, with one or more key lines of code replaced with comments. Read the problem description and examine the sample output; then study the template code. Using the problem-solving tips as a guide, replace the/comments with C++ code. Compile and execute the program. Compare your output with the sample output provided. Then answer the follow-up question. The source code for the template is available at www.deitel.com and www.prenhall.com./deitel Lab Objectives This lab was designed to reinforce programming concepts tion. In this lab, you will practice: from Chapter 7 ofC How To Program: Fifth Edi- Sorting data using the bubble sort algorithm. The follow-up question and activity also will give you practice Optimizing a program to be more efficient Description of the Problem In the bubble sort algorithm, smaller values gradually "bubble their way upward to the top of the array like air bubbles rising in water, while the larger values sink to the bottom. The bubble sort makes several passes through the array. On each pass, successive pairs of elements are compared. If a pair is in increasing order (or the values are identical), we leave the values as they are. If a pair is in decreasing order, their values are swapped in the array Write a program that sorts an array of 10 integers using bubble sort. Data items in original order 2 6 4 8 10 12 89 68 45 37 Data items in ascending order 2 4 6 10 12 37 45 68 89