I need some help coding this in c++. Please and thank you unction10:28all 32%Example 6Sort the following array inan ascending order. intarray {32, 23, 43, 21, 39,31, 15, 34, 38, 14}. Usethe algorithm given on thelast slide.1 / Example// Sort array in ascending ordertinclude ciostrean4 laclude cstringusing nanespace std,int main()int a[10)-(32, 23, 43, 21, 39, 31, 15, 34, 38, 14);Int tene; //for spping10for(int i-e; ic1e; i11-12for(int 1-1+1; k10:1++)(//compare with next elenent onardsteno-al1):/SAP process starts(/store fiest elesest1415I/store the second element into first(/store the temp (has first) Into secondI/Elements are sappedals)-temp181920212223 )I/print serted arrayfor(int ie; i1e; i)coute ca[1k :12Example 7• Rewrite example 6 and make the sorting code as a functionfSortAsc(array, length). This function will also print thesorted array. Call this function in main (). Use the same arrayas in example 6. Here is a portion of what the main () lookslike for this example. Hint: move the sort code from example 6to the function fSortAsc.I/ MB Example 7I/ Sort array functioninclude clostreamtinclude stringsusing namespace std;vodd fSortasc(int al), int length),int mainOint a[10)-(32, 23, 43, 21, 39, 31, 15, 34, 18, 14);fSortáscia, 1a);10111312 }13Example 8• Continue example 7 and add the sorting of the array indescending order as a function fSortDesc(array,length).This function will also print the sorted array. Call this functionin main. Use the same array as in example 6. The main() mustlook like this.I H Ecample a/ Sort array function3 tinelude ciestream4 Binclude cstringusing nanespace std;veld fSortasc(int all, Int length);7 void fSortDesc(int all, int length);9 int nain()19-int a[101-(32, 23, 43, 21, 39, 31, 15, 34, 38, 14);12 Sortáscia, 10)ceutccendl;14 Sortbesc(a,10):15 }111414Matrices- two dimensional arraysA matrix is a table with rows and columns 10:28 A令.all 32%M8- Arrays 2 - Read-onlycample 61 / M8- Example 6// Sort array in ascending order23.#include #include 5 using namespace std;4int main()int a[10]={32, 23, 43, 21, 39, 31, 15, 34, 38, 14};int temp; //for swappingfor(int i=0; i<1®; i++){for (int j-1+1; j<1@;j++){//compare with next element onwards1011.12-if(a[i]>a[j]){temp-a[i];a[i]-a[j];a[j]-temp;13-14//SWAP process starts//store first element//store the second element into first//store the temp (has first) into second//Elements are swapped151617181920//print sorted arrayfor(int i=0; i

As per company rules we are only allowed to answer first question when multiple questions are…

• Sort the following array in an ascending order. int array {32, 23, 43, 21, 39, 31, 15, 34, 38, 14}. Use the algorithm given on the last slide. 1 I tple 2 Sort array in ascenting order 3 include iestrean 4 aclude estring S using nanespace std, iet nain() int a(1e)-(32, 23, 43, 21, 39, 31, 15, 34, 38, 14); Int tene far pine 10 11- for(int i e , for(int 1-1+1 i/ompare utth et eleent onards 1S proces starts /stere first eleset tep-ali: Istere the second element ito first al1)-ten Istere the temp (has first) into second 17 Elements are spped 18 19 20 21 22 /print serted array for(int ie; ie; ) coutal1 23 12

• Sort the following array in an ascending order. int array {32, 23, 43, 21, 39, 31, 15, 34, 38, 14}. Use the algorithm given on the last slide. 1 I tple 2 Sort array in ascenting order 3 include iestrean 4 aclude estring S using nanespace std, iet nain() int a(1e)-(32, 23, 43, 21, 39, 31, 15, 34, 38, 14); Int tene far pine 10 11- for(int i e , for(int 1-1+1 i/ompare utth et eleent onards 1S proces starts /stere first eleset tep-ali: Istere the second element ito first al1)-ten Istere the temp (has first) into second 17 Elements are spped 18 19 20 21 22 /print serted array for(int ie; ie; ) coutal1 23 12

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter12: Points, Classes, Virtual Functions And Abstract Classes

Section: Chapter Questions

Problem 29SA

See similar textbooks

Similar questions

Write the function lastOf which searches the array a for the last occurance of any value contained in the array b. Returns the index if found. If not found, return -1. arrays.cpp 1 #include 2 int last0f(const int a[], int alen, const int b[], int bLen) { 3 4 5 6 7 8 }
Kim Gigabit purchase items of various quantities; valid quantities are greater than 0 and less than 100Read the quantity for each 10 items from the keyboard and store each into an integer array; if Kim enters a quantity of 0, negative, or greater than 100, it should be rejected, and she should be queried for a valid entry 1. After the valid entries are complete, display the unsorted array content, pass the unsorted array to another method for sorting, and display of the sorted array; you can use the code below for sorting 2. Modify the code below using the while loop /* * To change this license header, choose License Headers in Project Properties. * To change this template file, choose Tools | Templates * and open the template in the editor. */ package sortascending; public class Sortascending { public static void sortAsc( int[] arrayToSort ) { // Find the integer that should go in each cell j of // the arrayToSort, from cell 0 to the end for…
Lab 16 Implementing bubble sort In this lab, you will implement the bubble sort algorithm. The bubble sort is so called because it compares adjacent items, "bubbling" the smaller one up toward the beginning of the array. By comparing all pairs of adjacent items starting at the end of the array, the smallest item is guaranteed to reach the beginning of the array at the end of the first pass. The second pass begins again at the end of the array, ultimately placing the second smallest item in the second position. During the second pass, there is no need to compare the first and second items, because the smallest element is guaranteed to be in the first position. Bubble sort takes at most n - 1 passes for an array of n items. During the first pass, n - 1 pairs need to be compared. During the second pass, n - 2 pairs need to be compared. During the ith pass, n - i pairs need to be compared. During the last pass, n - (n - 1) or one pair needs to be compared. If, during any pass, no two…
Lab 16 Implementing bubble sort In this lab, you will implement the bubble sort algorithm. The bubble sort is so called because it compares adjacent items, "bubbling" the smaller one up toward the beginning of the array. By comparing all pairs of adjacent items starting at the end of the array, the smallest item is guaranteed to reach the beginning of the array at the end of the first pass.The second pass begins again at the end of the array, ultimately placing the second smallest item in the second position. During the second pass, there is no need to compare the first and second items, because the smallest element is guaranteed to be in the first position.Bubble sort takes at most n - 1 passes for an array of n items. During the first pass, n - 1 pairs need to be compared. During the second pass, n - 2 pairs need to be compared. During the ith pass, n - i pairs need to be compared. During the last pass, n - (n - 1) or one pair needs to be compared. If, during any pass, no two…
Kim Gigabit purchases items of various quantities; valid quantities are greater than 0 and less than 100Read the quantity for each 10 items from the keyboard and store each into an integer array; if Kim enters a quantity of 0, negative, or greater than 100, it should be rejected, and she should be queried for a valid entry 1. After the valid entries are complete, display the unsorted array content, pass the unsorted array to another method for sorting, and display of the sorted array; you can use the code below for sorting /* * To change this license header, choose License Headers in Project Properties. * To change this template file, choose Tools | Templates * and open the template in the editor. */ package sortascending; public class Sortascending { public static void sortAsc( int[] arrayToSort ) { // Find the integer that should go in each cell j of // the arrayToSort, from cell 0 to the end for ( int j=0; j<arrayToSort.length-1; j++ )…
2. For the following array, you are to perform a binary search: Int nums[ ]= {1, 13, 78, 89, 96, 100, 112, 125, 230, 310, 423, 578, 1000); Search for the number 126 by showing the low, midpoint and high values at each step before it reports that 126 is NOT found in the array. Low Mid High
Multiply left and right array sum. Basic Accuracy: 54.29% Submissions: 12630 Points: 1 Pitsy needs help in the given task by her teacher. The task is to divide a array into two sub array (left and right) containing n/2 elements each and do the sum of the subarrays and then multiply both the subarrays. Example 1: â€
Executable C++ program shown in Figure Q2(c) is executing insertion and deletion algorithms by using array data structure. Write the complete output after the program execution. #include using namespace std; class InsDel { private: int Array[]; public: void gen_array(); void disp_array(); void insertion (int ,int ); void deletion (int ); }; void InsDel::gen_array () { for (int i = 0; i < 8; i++) { Array[i] = i*2; void InsDel::disp_array () for (int i = 0; i < 8; i++) { cout « "Arr[" « i « "]: " « Array[i] « endl; Continue...
Algorithm A3: substring (s, ip, len)1. Initialize i = ip and count = 02. Use an array „dest‟ to hold the required substring3. Repeat steps 4 ,5 and 6 while count < len4. dest[count] = s[i]5. count = count +16. i = i + 17. Insert string terminator at end of dest8. Exit run the above algorithms in C/C++
Data Structure & Algorithm: Here is an array with exactly 15 elements:1 2 3 4 5 6 7 8 9 10 11 12 13 14 15Suppose that we are doing a serial search for an element. Circle any elements that will be found by examining two or fewer numbers from the array.
#define MAXELEMENTS 10 main() { int array [MAXELEMENTS] //end of main Which of these is true? O array[5] + array[6] = 17 O array[5] + array[6] = 40 O array[0] + array[9] = 140 The array's first element is array[54] (54,3,1, 4, 32,8,9,11, 23, 99);
84. Refer to the following method that finds the largest value in an array. /** Precondition: arr is initialized with int values. * @param arr the array to be processed * @return the largest value in arr */ public static int findMax(int[] arr) { int max = /* some value */; 0; int index %3D while (index max) arr[index]; max = index++; return max; } Which replacement(s) for /* some value */ will always result in correct execution of the findMax method? Integer. MIN _VALUE III. I. II. Integer.MAX_VALUE arr[0]