Modify selection_sort.c so that it includes the following functions: void selection_sort(int "a, int n); int *find_largestint "a, int n); void swap(int "p, int "a); selection_sort function: it should call find_largest function and swap function. find_largest function: when passed an array of length n, the function will return a pointer to the array's largest element. The function should use pointer arithmetic - not subscripting - to visit array elements. In other words, eliminate the loop index variables and all use of the (] operator in the function. swap function: when passed the addresses of two variables, the function should exchange the values of the variables: swap(&i, &i): * exchange values of i and j*/ Your program will cll find_largest function and swap function in selection_sort function.

Modify selection_sort.c so that it includes the following functions: void selection_sort(int "a, int n); int find_largestint "a, int n); void swap(int "p, int "a); selection_sort function: it should call find_largest function and swap function. find_largest function: when passed an array of length n, the function will return a pointer to the array's largest element. The function should use pointer arithmetic - not subscripting - to visit array elements. In other words, eliminate the loop index variables and all use of the (] operator in the function. swap function: when passed the addresses of two variables, the function should exchange the values of the variables: swap(&i, &i): exchange values of i and j*/ Your program will cll find_largest function and swap function in selection_sort function.

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

C language. Function write the arraylist_sort function This generic function sorts an array list using the given compare function. l An array list compare Pointer to the function which compares two elements If you cannot write down a generic function which works for all types, write down a function which sorts resturants. If you cannot use function pointers, you can write down multiple functions which sort using different criteria.
Computer Science Done in Perl. Someone gave me a wrong/incomplete answer. Write a function, hashsum, which takes a hash reference as its first argument and an array reference as its second argument. The function should take the elements of the array and use them as keys in the hash. The values in the hash corresponding to the keys in the array should be totaled, and the sum should be returned to the user. If a key passed in the array does not exist in the hash, ignore it. Write a sample program to call this function.
3. Pointers – Arrays: initializing content • Using the pointer ptrArray, you now want to write values in those integers. Use a loop to go through each element in that array, and initialize them all to 42. This is done in the main. 4. Pointers – Arrays: printing • Write a function that will print the elements in the array-pointer. The function should accept a pointer to an integer, and the size of this array. The function should not return anything. Here is your function prototype: void printArray(int* ptr, int nb); • Your function needs to use a loop to go through all the elements in the array, and simply prints them on a new line. • In the main function, call this function with your pointer ptrArray and the size given by the user.
Write a function that takes an array of objects and a key, and returns a new array sorted based on the values of that key in ascending order.
1. Write a function named "isBoundedArray" that accepts an array of integersand its size. The function will check the array to see whether the first and the last elementsin the given array are the smallest and largest in the list,or the largest and smallest in the list.If they are, it will return true. Otherwise, it will return false. Requirement: please use only pointer notation in the function. No array notation. For example, the following arrays will return true int numList0[] = {10} ; int numList1[] = {10, 20, 30, 40} ; int numList2[] = {40, 30, 20, 10} ; int numList3[] = {10, 30, 20, 40} ; int numList4[] = {40, 20, 30, 10} ;And these arrays will return false int numList5[] = {10, 40, 20, 30} ; int numList6[] = {40, 20, 30, 50} ; 2. Write a function named “isBinaryString” that accepts a C-string (an array of characterswith a NULL terminating character)and returns trueif that C-string contains a valid binary number and false otherwise. A valid binary string is defined…
Language: C++ A shell sort algorithm is a variation of insertion sort. Your task is to sort the array of 50 elementsusing shell sort only. You are required to write the member functions of the following:- Create random data. Apply shell sort. Count the number of comparison operations.- Create sorted array. Apply shell sort. Count the number of comparison operations.- Create nearly sorted data. Apply shell sort. Count the number of comaprison operations.- Create data with duplicates. Apply shell sort. Count the number of comparison operations.Write down your observations.
Flowchart, create. Passing Lists to Functions in Python def reverseArray(array): for i in range(len(array)//2): array[i], array[len(array)-i-1] = array[len(array)-i-1], array[i] numbers = [9, 8, 7, 6, 5] print("Original contents of array:[9, 8, 7, 6, 5] ") print("Reversed contents of array:[5, 6, 7, 8, 9] ")
In Quick Sort, the function Partition is used to arranged the values into the S1 set and S2 set based on the pivot value. Given the following array, what is the content of the array after the function Partition finished the 1st pass assuming the pivot value is 40? array: 44 12 50 3 40 23 Question 4 options: 3 12 23 40 44 50 12 3 23 40 44 50 40 12 3 50 44 23 23 12 3 40 44 50
Write a function named "isBoundedArray" that accepts an array of integersand its size. The function will check the array to see whether the first and the last elementsin the given array are the smallest and largest in the list,or the largest and smallest in the list.If they are, it will return true. Otherwise, it will return false. Requirement: please use only pointer notation in the function. No array notation. For example, the following arrays will return trueint numList0[] = {10} ;int numList1[] = {10, 20, 30, 40} ;int numList2[] = {40, 30, 20, 10} ;int numList3[] = {10, 30, 20, 40} ;int numList4[] = {40, 20, 30, 10} ;And these arrays will return falseint numList5[] = {10, 40, 20, 30} ;int numList6[] = {40, 20, 30, 50} ;
Write a void function called largerThanLast whose heading is given below. The function should print all the numbers in the array which are larger than the last element in the array. arraySize represents the number of elements in the array. void largerThanLast (int List[ ], int arraySize)
When calling a swap function to swap the value of the two arrays, how do I add the reference to the calling statement without giving me an error? Also, I have to use pointers for this assignment. Here is the code: const int S = 10; //Pre-condition: two c strings of the same size //Post-condition: swap the values of the c strings void swapArr(char array1[ S], char array2[ S]) { int size = 0; for (int i = 0; array1[1] != '\0'; i++) { size++; } char* value = new char; value = new char [size]; //Loop fusion for (int i = 0; i < size; i++) { //Swap the values value[i] = array1[i]; array1[i] = array2[i]; array2[i] = value[i]; } } int main(){ char array1[S]= { "Hello" }; char array2[S] = { "World"}; //For some reason the swap function is not working swapArr(& array1[S], & array2[S]); for (int i = 0; array1[i] != '\0'; i++) { std::cout << array1[i]; } }
test_var = 'AAMMTTMT';//test_var is testing variable takenarray = test_var.split('');//string is split into the array function SWAP(TAM, i, j)//function to swap{temp = TAM[i];TAM[i] = TAM[j];TAM[j] = temp;}function sort_AMT(TAMUK)//function to sort the array{for(i = 0; i<TAMUK.length;i++){for(j = 0; j<TAMUK.length-1;j++){if(TAMUK[i]<TAMUK[j])SWAP(TAMUK,i,j);}}console.log(TAMUK);} sort_AMT(array);//function call How to write an HTML code for this javascript result/output? where the result will be displayed in HTML page.