1.7 Comment out the loops that print text with std::cout to avoid too much textprinting to the terminal and then set n=10000. Make testsort again. You can nowtime the program with different algorithms by using:time testsortto run an executable called testsort. In the output, the first number preceeding theu is roughly the number of cpu-seconds used. Time the algorithms and see whichone performs best. Try timing more than once to verify your results. Report yourresults.1.8 Repeat the timing exercise but this time with an array of 10,000 numbers thatis already ordered both top-down and bottom-up, A[i]=i or A[i]=n-i+1. Reportthe results and explain the outcomes. 1.4 Consider the operation of swapping two values. Explain what is wrong withthis:// Swap A[i] and A[j];A[i] = A[j];A[j] = A[i];1.5 Implement the Partition function of the Quick Sort algorithm first, as a functionin the files sort.cpp and sort.h. Parition takes an array and an integer as argumentsbut it also returns an integer. It is not void like InsertionSort. The partitionchooses a value in the array and then rearranges the array into those elements smallerand larger than this value.smaller than the partitioning value and this is the information it returns.Partition from your testsort.cpp and have it print out the partition count justto check it works with option 2. There is already a line of code you can uncommentto do this in testsort.cpp.As part of that process it counts how many values areCallSimple pseudo-code for a recursive version of QuickSort which uses the above Partitionfunction is listed below. It relies on the partition to produce two sub-arrays where every elementof the first one is guaranteed to all be lesser in value than every element of the second one.Once the process has progressed until the sub-arrays are 0 or 1 long then the sort is completed.Quick SortO QuickSort(A, n)if n >1 thenq+Partition(A, n)QuickSort(A[0...q – 1), q)QuickSort(A[g +1...n – 1], n – 1– q)end ifO end QuickSort1.6 Implement the above Quick Sort algorithm as a function called QuickSort infiles sort.cpp and sort.h. It will use your Partition function. Modify testsort.cppto test the quick sort, make it and test that it sorts correctly by running testsortand choosing option 3.Now that we have verified that the sorts work, we are ready to test the performance of thealgorithms.

AS PER THE INSTRUCTIONS FROM BARTLEBY WE ARE SUPPOSED TO SOLVE ONLY ONE QUESTION,THEREFORE I AM…

Answered: 1.4 Consider the operation of swapping…

1.4 Consider the operation of swapping two values. Explain what is wrong with this: // Swap A[i] and A[j]; A[i] = A[j]; A[j] = A[i];

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

int a[100], b[1000], c[1000]; // get some data for a, b, and c for (i = 0; i < 100; i++) for (j = 0; j < 10; j++) a[i] += c[j*100 + i] * b[j*100 + i] ;
Please define and initialize and array X of length 8. You need implement following and write outcomes with reasons; 1.cout<< X+1; 2.cout<<&X+1; 3.cout<<2[X]; 4.cout<<&X[0]+1; 5.cout<<*(X+1); 6.cout<<*X+1; Also, practice and play with pointers using multiplication, division, subtraction and addition. You may also play with it your ways and find out reasoning. Write down those reasoning.
Group B Q1) A vector is given by x = [-3.5-5 6.2 11 0 8.1-903-132.5]. Using conditional statements and loops, write a program that creates two vectors from x-one (call it P) that contains the positive elements of x, and a second (call it N) that contains the negative elements of x. In both P and N, the elements are in the same order as in x.
zybooks.com/zybook/SNHUIT140v3/chapter/1/section/9 Eric Chipotle 12 cars library> IT 140: Introduction to Scripting v3 home > 1.9: LAB: Input: Mad Lib zyBooks catalog ? Hel Complete the program to read four values from input and store the values in variables first_name, generic_location, whole_number, and plural noun. The program uses the input values to output a short story. Ex: If the input is: Brenda Philadelphia Home 6 bells the output is: Eric went to Chipotle to buy 12 different types of cars Ex: If the input is: the output is: O Mail - Rasin, Anthony-Outlook x LAB Brenda went to Philadelphia to buy 6 different types of bells zy Section 1.9-IT 140: Introducti
a) Apply Bucket-Sort on the following input. Show your work in a similar way that we did in the class. Assume we use 10 buckets. A = [0.88, 0.32, 0.15, 0.6, 0.55, 0.11, 0.52, 0.12, 0.83, 0.31, 0.19, 0.81] b) We saw in the class that Bucket Sort is useful when the input is uniformly distributed. Consider the following input which is NOT uniformly sorted: n/logn items are uni- formly distributed in [0, 0.8], log² n items are uniformly distributed in (0.8, 0.9] and the remaining n - n/logn - log² n items are uniformly distributed in (0.9, 1]. Repeat the analysis from the class to describe the expected running time of Bucket- Sort with parameter k = n/20 for the above input. You may assume that we a comparison-based sorting algorithm with running time (n log n) to sort items within each bucket.
3 Linker Assigned Symbol Strength · The C-code below is one file, symbol.c. For each of the 10 symbols present (s0, s1, it is internal, weak external, or strong external. s9), tell whether .... int s0(int s1, int s2); double s2 = 0, s3; int s4; void s5(long s6) { float s7 = 2.0, s8 = 4; }
(4) {w € [0, 1]* : w does not have 001 as a substring} Testing strings: €, 0, 1, 01, 000, 001, 0001, 0010, 0101, 11000, 110010 The accepted strings are: L U E O 01 000 001 0001 ☐ 0010 0101 11000 110010
1. Trace the execution of the following: {0, 1, 2, 3, 4, 5, 6, 7}; int[] anArray for (int i = 3; i 3; i--) 1]; What are the contents of anArray after the execution of each loop?
This is What i have so far. #include <iostream> // for cin and cout#include <iomanip> // for setw() and setfill()using namespace std; // so that we don't need to preface every cin and cout with std:: void printFirstTwoBuildingSection(int n, int startSpacing){int start = n / 2, end = 0;if (n <= 2){start = 0;}for (int i = 0; i < n; i++){for (int j = 0; j < startSpacing; j++){cout << " ";}cout << "|";if (i < (n / 2)){for (int k = 0; k < i; k++){cout << " ";}cout << "\\";for (int k = 0; k < start; k++){cout << " ";}cout << "/";start -= (n / 2);for (int k = 0; k < i; k++){cout << " ";}cout << "|" << endl;}else{for (int k = n - i - 1; k > 0; k--){cout << " ";}cout << "/";for (int k = 0; k < end; k++){cout << " ";}cout << "\\";end += (n / 2);for (int k = n - i - 1; k > 0; k--){cout << " ";}cout << "|" << endl;}}for (int j = 0; j < startSpacing;…