Write the following variant of insertion sort. // The function gets an array of length n of ints, // and applies the Insertion Sort algorithm on the array. // The function returns the array of ints of length n // where output [i] contains the number of swaps // made by the algorithm in the i'th iteration of the outer loop int* insertion_sort(int* array, int n); For example: If the input is the array A=[4,3,6,1,2,5], Insertion Sort on A works as follows: - Insert 4: [4,3,6,1,2,5]: 0 swaps - Insert 3: [3,4,6,1,2,5]: 1 swaps - Insert 6: [3,4,6,1,2,5]: 0 swaps - Insert 1: [1,3,4,6,2,5]: 3 swaps - Insert 2: [1,2,3,4,6,5]: 3 swaps - Insert 5: [1,2,3,4,5,6]: 1 swaps After the execution of the function (1) A will become [1,2,3,4,5,6] (2) the function returns [0,1,0,3,3,1].

Write the following variant of insertion sort. // The function gets an array of length n of ints, // and applies the Insertion Sort algorithm on the array. // The function returns the array of ints of length n // where output [i] contains the number of swaps // made by the algorithm in the i'th iteration of the outer loop int* insertion_sort(int* array, int n); For example: If the input is the array A=[4,3,6,1,2,5], Insertion Sort on A works as follows: - Insert 4: [4,3,6,1,2,5]: 0 swaps - Insert 3: [3,4,6,1,2,5]: 1 swaps - Insert 6: [3,4,6,1,2,5]: 0 swaps - Insert 1: [1,3,4,6,2,5]: 3 swaps - Insert 2: [1,2,3,4,6,5]: 3 swaps - Insert 5: [1,2,3,4,5,6]: 1 swaps After the execution of the function (1) A will become [1,2,3,4,5,6] (2) the function returns [0,1,0,3,3,1].

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

In main() for now: do these - one at a time, each in it's own loop (we will make functions out of them later –Declare an array RandArray with 20 integers –Assign each of the 20 values with a random value from 0 to 99 Hint: Use rand()%100 For mimir: Do not call srand at the top of main. // normally: Call srand(time(0)) at the top of main –(you need #include<cstdlib>) –Write another loop that prints the array, with index values Important: If the output values do not match mimir, please add srand(17); // inside your main function - at the top code format: #include <iostream>using namespace std; #include <cstdlib> // required for rand() int main(){ srand(17); // define a constant ARRAYSIZE that is 20 // declare randArray // set the 20 elements in randArray to be a random number between 0 and 99 // hint: use rand()%100 // print the 20 values return 0;}
Write a function that returns trueif the product of an array is divisible by the sum of that same array. Otherwise, return false. Example: divisible([3, 2, 4, 2]) →false WRITE IN PYTHON PLEASE
: In searching an element in an array, linear search can be used, even though simple to implement, but not efficient, with only O(n) time complexity. Assuming the array is already in sorted order, modify the search function below, using a better algorithm, so the average time complexity for the search function is O(log n). include <iostream> using namespace std; int search(int al), int s, int v) { 1/ Modify below codes. for (int i = 0; i <s; i++) { if (a[i] = v) return i; return -1; int main() { int intArray:10] = { 5, 7, 8, 9, 10, 12, 13, 15, 20, 34); // Search for element '12' in 10-elements integer array. cout << search(intArray, 10, 12); // '5' will be printed out. // Search for element '35' in 10-elements integer array. cout << search(intArray, 10, 35); // '-1' will be printed out. // Index '-l' means that the element is not found. return 0;
Fun with Sorting :Given the following array of numbers:8 2 3 9 10 1 4 6 7 5Show what the array looks like after each iteration of the following sorting algorithms:1) Bubble2) Selection3) Insertion4) MergesortOnly show the array contents with each algorithm. You do not need to show function callinstances if recursion is used or write any code. Just show the array at key iterations of thealgorithm. You can use your own words to describe them as well for more detail (but do notwrite any code).
ugb
Complete the following function definition to recursively print the index of a unique value in an array or -1 if the value is not found:1 int getIndex(int *a, int s, int v) {2 if( ) { // if no values are found3 4 }5 if(a[s-1] == v) { // if a value is found6 7 }8 return getIndex( ); // recurse to check next value9 }Hint:Recurse through the array by counting down from size. 1. Complete the one line of code for line 2:2. Write one line of code for line 3:3. Write one line of code for line 6:4. Complete the one line of code for line 8: please send an atom code. not other software
1. Rewrite the Bubble sort to use recursion. 2. Use the time(0) function to determine how many seconds it takes to sort a vector using the recursive method. 3. Use the time(0) function to determine how many seconds it takes to sort a vector using the non-recursive method described in the videos. Run the sort test on vectors containing random integers. You should sort vectors of the following sizes: 100 elements, 1000 elements, 5,000 elements, 10,000 elements and 50,000 elements. Was the recursive method able to work on vectors of each of those sizes? If not, explain why it errored. 4. Create a class that will store a vector of planets (See the Planet assignment). Your class will have functions to add a planet, delete a planet and sort the planets. The class must utilize the insertion sort.
1. Rewrite the Bubble sort to use recursion. 2. Use the time(0) function to determine how many seconds it takes to sort a vector using the recursive method. 3. Use the time(0) function to determine how many seconds it takes to sort a vector using the non-recursive method described in the videos. Run the sort test on vectors containing random integers. You should sort vectors of the following sizes: 100 elements, 1000 elements, 5,000 elements, 10,000 elements and 50,000 elements. Was the recursive method able to work on vectors of each of those sizes? If not, explain why it errored.
In statistics the median of a set of values is the value that lies in the middle when the values are arranged in sorted order. If the set has an even number of values, then the median is taken to be the average of the two middle values. Write a function that determines the median of a sorted array. The function should take an array of numbers and an integer indicating the size of the array and return the median of the values in the array. You may assume the array is already sorted. Use pointer notation whenever possible.
Subject: Data structure
There is a recursive function called `longestToShortest` which takes an array of lowercase ot strings and returns them sorted from longest to shortest. Strings of equal length should be sorted alphabetically. Your function should accept a default argument called `sorted` which holds the currently sorted elements. Each recursive step should add the shortest string in the `strings` array to the end of `sorted`. // Examples: // Sorts strings from shortest to longest let strings1 = ["abc", "de", "", "f", "ghijk", "lmno"] shortestToLongest(strings1); // ['', 'f', 'de', 'abc', 'lmno', 'ghijk'] function longestToShortest(strings, sorted = []) { } Please explain all steps Line by line, Show all work inside the function to pass the example console.log test cases. Please do it in the recursive function only. Thank you!
Implement the following function to sort the columns in a two-dimensional array. A new array is returned. The original array is intact. const int SIZE = 3;void sortColumns(const double m[][SIZE], double result[][SIZE]); Write a test program that prompts the user to enter a 3 * 3 matrix of double values and display a new column-sorted matrix.