Build a function that creates histograms. Every bar needs to be on a new line and its length corresponds to the numbers in the array passed as an argument. The second argument of the function represents the character to be used for the bar. histogram(arr, char) → str Examples histogram ([1, 3, 4], "#") "#\n###\n####" # ### #### histogram ([6, 2, 15, 3], "=") → == - + 11 histogram ([1, 10], "+") "+\n+++++ ==\n==\n== =\n==="

Build a function that creates histograms. Every bar needs to be on a new line and its length corresponds to the numbers in the array passed as an argument. The second argument of the function represents the character to be used for the bar. histogram(arr, char) → str Examples histogram ([1, 3, 4], "#") "#\n###\n####" # ### #### histogram ([6, 2, 15, 3], "=") → == - + 11 histogram ([1, 10], "+") "+\n+++++ ==\n==\n== =\n==="

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

Write a function that takes two int arrays arr1 and arr2, and their size n as parameters. The functionreturns the number of elements that exist in arr1 and arr2 with indexes i1 and i2 respectively such that i1>=i2.(Example: arr1: [ 1,5,2,3,4,0,7] arr2: [0,1,3,7,4,2] then the function returns 3 ( 0,3,7) )
Write a function is ordered that takes an integer array and its size as parameters and returns true if the array elements are ordered in nondecreasing order and returns false if not. For example, integers in {10,0,1,1,5,1009} are ordered in nondecreasing order. On the other hand, integers in {1, 2, 3, 8, 4, 19} are not since 8 > 4
Write a Program for insertion and deletion from an array without replacement of element from the arrays. Also, write a program to search the array for the presence of a given element from an array. Write the sub-functions in the provided test case in text form and upload the same. #include<stdio.h> #include<stdlib.h> int cmpfunc (const void * a, const void * b) { return ( *(int*)a - *(int*)b ); } int insert_function(int *data, int n, int p, int x) { /* input data: array, n: size of array, p: position of insertion, x: element to insert*/ /*output:-1 indication error or 0 if successful /* write the function for inserting element into a position*/ } int delete_function(int *data, int n, int p, int x) { /* input data: array, n: size of array, p: position of deletion, x: element to deletion*/ /*output:-1 indication error or 0 if successful /* write the function for delete element into a position*/ } int linear_search_function(int *data, int n, int x) { /*write the function to…
Write a function SwapArrayEnds() that swaps the first and last elements of the function's array parameter. Ex: sortArray = {10, 20, 30, 40} becomes {40, 20, 30, 10}. #include <iostream>using namespace std; /* Your solution goes here */ int main() { const int SORT_ARR_SIZE = 4; int sortArray[SORT_ARR_SIZE]; int i; int userNum; for (i = 0; i < SORT_ARR_SIZE; ++i) { cin >> userNum; sortArray[i] = userNum; } SwapArrayEnds(sortArray, SORT_ARR_SIZE); for (i = 0; i < SORT_ARR_SIZE; ++i) { cout << sortArray[i] << " "; } cout << endl; return 0;}
Write a function that gets an array as a parameter, sorts it in an ascending fashion and returns the number of elements that did not change position in the sort (they were originally in the right position). Use c code int sortASC(int* myArray, int size) if array ={ 2, 3, 1, 0, -1} after calling the function the array should become {-1, 0, 1, 2 , 3 } and the function should return 1 (only one element has not changed place in the array)
In C++: 1) Write a printRange function which prints all values of an unsorted array (smallest to largest) between A and B inclusive. This function should accept all required data as parameters.ExamplesIf the array is 25 8 13 5 27 6 72 48, A is 20 and B is 40, this function prints 25 27.If the array is 10 1 28 42 18 34 100 125, A is 8 and B is 32, this function prints 10 1 28 18.
Consider the following function main:int main(){int alpha[20];int beta[20];int gamma[4] = {11, 13, 15, 17};int delta[10] = {3, 5, 2, 6, 10, 9, 7, 11, 1, 8};. . .}a. Write the definition of the function setZero that initializes any one-dimensional array of type int to0.b. Write the definition of the function inputArray that prompts the user to input 20 numbers and storesthe numbers into alpha. Ex-10 ENGR2217 SP20c. Write the definition of the function doubleArray that initializes the elements of beta to two timesthe corresponding elements in alpha. Make sure that you prevent the function from modifying theelements of alpha.d. Write the definition of the function printArray that prints any one- dimensional array of type int.Print 15 elements per line.
Suppose you have an array of integer caller myArray that is arranged in ascending order. Write a user-defined function in C++ to search for an integer from myArray using the Binary Search method, this function returns an integer 0 if the number is not found and integer 1 if the number is found. The function should have three parameters: array myArray, array size N, and the number to be searched key.
Write a function called remove_punct() that accepts an array of characters and the number of items in the array as parameters, removes the punctuation (',', '!', '.') characters from the array, and returns the number of punctuation characters removed. For example, if the array contains ['C', 'p', 't', 'S', ',', '1', '2', '1', '.', 'i', 's', 'f', 'u', 'n', '!'], then the function should remove the punctuation characters. The function must remove the characters by shifting all characters to the right of each punctuation character, left by one spot in the array. This will overwrite the punctuation characters, resulting in: ['C', 'p', 't', 'S', '1', '2', '1', 'i', 's', 'f', 'u', 'n']. In this case, the function returns 3. Note: if the array does not contain any punctuation characters, then the array is unchanged and the function returns 0.
Implement a C function, named median, that receives two arrays as parameters passed and returns the median of the values stored in these two arrays. The two arrays are sorted. The prototype of the function MUST be: double median(int a[], int b[], int sizeA, int sizeB);For example, if I have int a[] = {1, 2, 10, 12, 100}; and int b[] = {3, 11, 20, 500, 600}; then the median is (11+12)/2 = 11.5.
2. Implement a function called findMinGap that will return the smallest gap betweenadjacent entries of an integer array. A gap between two numbers is the absolutevalue of their difference. For example, if an array contains the elements {10, 14,-5, -3, 0, 5, 7}, the minimum gap is 2 (between -5 and -3).Title line: int findMinGap(int array[], int length)
Write a program which shouldconsists of a user definedfunction “Newfunction ()”. Pass1D array to the function, alongwith number of elements ofarray and element to search.The Function should implementlinear search. [Note: Arrayshould be passed using by valueapproach] "PLEASE ANSWER IT IN BASIC C PROGRAMMING " """NOT C++""". ANSWER IN NORMAL C LANGUAGE/PROGRAMMING