Need help with example 7, written 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

Here is the complete code of the example 7, written in c++ #include <iostream>#include…

Answered: Need help with example 7, written in…

Engineering

Computer Science

Need help with example 7, written in c++. Please and thank you

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

c++ int primes={21,23,25,37,11,13,17.19,23,29,31,37,41,43,47,53,59,61,67,73,79,83,89,97} consider the above array of primes you have to search 53 in the array, also you have to check whether 53 is prime or not, also keep count of how many primes comes before 53.
Select true or false for the statements below. Explain your answers if you like to receive partial credit Select true or false for the statements below. Explain your answers if you like to receive partial credit Which of the following is true about searching elements in an unordered array? With the data is unsorted, search is O(n) because if the element you are looking for is not there, you have to check every element in the array If you start at the end of the array and traverse to index 0, search improves to O(log n) because you only have to look at half of the array If you get lucky with checking the first element and find it immediately, then the worst case performance of search improves to O(n^2) Which of the following is true about searching elements in an ordered array? You cannot use binary search on an ordered array so the performance is O(n) If there are no holes in the array and the elements are all next to each other, then the performance for search improves to…
Following is the function for interpolation search. This searching algorithm estimates the position (index) of a key in array based on the elements in the first position and last position in the array, and the length of array. The array must be sorted in ascending order. Suppose array A contains the following 15 elements: A = [1, 3, 3, 10, 17, 22, 22, 22, 24, 25, 26, 27, 27, 28, 28] At first iteration, at which position (index) the element of 24 is estimated in array A? In which part of array (starting index and ending index) the searching should continue? How many iterations the searching are performed until the element of 24 is found? int InterpolationSearch(int x[], int key, int n) { int mid, min = 0, max = n-1; while(x[min] < key && x[max] > key) { mid = min + ((key-x[min])*(max-min)) / (x[max]-x[min]); if(x[mid] < key) min = mid + 1; else if(x[mid] > key) max = mid - 1; else return mid; } if…
2. An interpolation search assumes that the data in an array is sorted and uniformly distributed.Whereas a binary search always looks at the middle item in an array, an interpolation searchlooks where the sought-for item is more likely to occur. For example, if you searched yourtelephone book for Victoria Appleseed, you probably would look near its beginning ratherthan its middle. And if you discovered many Appleseeds, you would look near the lastAppleseed. Instead of looking at the element a[mid] of an array a, as the binary search would,an interpolation search examines a[index], where p = (desiredElement - a[first]) / (a[last] - a[first]) index = first + [(last – first) × p]Implement an interpolation search of an array. For particular arrays, compare the outcomesof an interpolation search and of a binary search. Consider arrays that have uniformlydistributed entries and arrays that do not. Modify and save the file asSearchComparerYourlastname.java.
// lab8ExB.cpp #include <iostream> using namespace std; void insertion_sort(int *int_array, int n); /* REQUIRES * n > 0. * Array elements int_array[0] ... int_array[n - 1] exist. * PROMISES * Element values are rearranged in non-decreasing order. */ void insertion_sort(const char** str_array, int n); /* REQUIRES * n > 0. * Array elements str_array[0] ... str_array[n - 1] exist. * PROMISES * pointers in str_array are rearranged so that strings: * str_array[0] points to a string with the smallest string (lexicographicall) , * str_array[1] points to the second smallest string, ..., str_array[n-2] * points to the second largest, and str_array[n-1] points to the largest string */ int main(void) { const char* s[] = { "AB", "XY", "EZ"}; const char** z = s; z += 1; cout << "The value of **z is: " << **z << endl; cout << "The value of *z is: " << *z << endl; cout << "The value of…
The code below computes the intersection (the number of entries shared by two arrays). It is assumed that neither array contains any duplicates. It computes the intersection by sorting one array (array b) and then iterating over array a to see if each value is in b (through binary search). What is its duration? nt intersection(int[] a, int[] b) {mergesort(b);}int intersect = 0;for (int x : a) {if (binarySearch(b, x) >= 0) {intersect++;return intersect; }}
Peaks and Valleys: In an array of integers, a "peak" is an element which is greater than or equalto the adjacent integers and a "valley" is an element which is less than or equal to the adjacentintegers. For example, in the array {5, 8, 6, 2, 3, 4, 6}, {8, 6} are peaks and {5, 2} are valleys. Given anarray of integers, sort the array into an alternating sequence of peaks and valleys.EXAMPLEInput: {5, 3, 1, 2, 3}Output: {5, 1, 3, 2, 3}
Select true or false for the statements below. Explain your answers if you like to receive partial credit1) Which of the following is true about searching elements in an unordered array?a. With the data is unsorted, search is O(n) because if the element you arelooking for is not there, you have to check every element in the arrayb. If you start at the end of the array and traverse to index 0, search improvesto O(log n) because you only have to look at half of the arrayc. If you get lucky with checking the first element and find it immediately, thenthe worst case performance of search improves to O(n^2)
Please help me with this assignment. For this assignment you will implement divide and conquer algorithms: merge sort . For merge sort, you will just implement the algorithm on an array of ints. I have provided the pseudo code for algorithms. You will need to handle cases of all sizes, not just powers of 2. Implement Merge Sort Create a class called MergeSorter in the divideandconquer package. This class willimplement merge sort on an array of ints. Implement the following method with the exactsignature below. You will need to create private helper methods that do most of the work. public static void mergeSort(int[] arr)This method sorts the int[] arr using the merge sort algorithm described in the pseudocodeabove.
Given the following array: 65, 15, 129, 22, 12, 10, 239, 334, 10, 111, 180, 1, 2 What will be the array contents looking like in the following situations: 1) after calling the partition method three times in quick sort if pivot is the last element. 2) after the third iteration of the outer loop in insertion sort. 3) after the third iteration of the outer loop in Selection sort.
There is an array with the original content as follows5,6,7,20,33,44,46,47,48,99,101,102,105Now execute Sequential search, and the state of the sorted array has been completed in the array, how many comparisons are required for the following numbers?48 : ___100 : ___
int g(int nums[], int n) { if (n == 1) return 0; int val = g(nums, n-1); if (nums[n-1] > nums[val]) return val; return n-1; } Give a recurrence T(n) for the number of times the code nums[n-1] > nums[val] is executed when the array values are in ascending order. Then solve the recurrence