1. Sorting • Begin by filling an array with random numbers: import numpy as np np.random.seed(1012) DATASIZE = 1000 MAX_VALUE = 10000000 data = np.random.randint(0, MAX_VALUE, size=DATASIZE) • Write a function that is passed a numpy array. The function should walk through the array element-by-element, comparing the current element to the next element. Swap if the next is smaller than the current – sorting these two elements. • Write a second function that calls the above function n times, where n is the number of elements (size) of the array. Pass the same numpy array each time.

1. Sorting • Begin by filling an array with random numbers: import numpy as np np.random.seed(1012) DATASIZE = 1000 MAX_VALUE = 10000000 data = np.random.randint(0, MAX_VALUE, size=DATASIZE) • Write a function that is passed a numpy array. The function should walk through the array element-by-element, comparing the current element to the next element. Swap if the next is smaller than the current – sorting these two elements. • Write a second function that calls the above function n times, where n is the number of elements (size) of the array. Pass the same numpy array each time.

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

1. Sorting• Begin by filling an array with random numbers:import numpy as npnp.random.seed(1012)DATASIZE = 1000MAX_VALUE = 10000000data = np.random.randint(0, MAX_VALUE, size=DATASIZE)• Write a function that is passed a numpy array. The function should walkthrough the array element-by-element, comparing the current element tothe next element. Swap if the next is smaller than the current – sortingthese two elements.• Write a second function that calls the above function n times, where n isthe number of elements (size) of the array. Pass the same numpy arrayeach time. 2. Bubble Sort• The sort from part 1 can be improved. If the data passed to be sorted isalready sorted, it still performs all of the work, as if the array was notsorted.Make two improvements:• Change the first function (the one that does the comparisons), so that it returns aboolean that states whether the array is sorted. Make use of that boolean to stopcalling the first function if the array is sorted.• Consider…
Randomly generate a partially filled array of unique values.a) Create a blank partially filled integer array of capacity 10.b) Implement an array print function.c) Implement a hasValue function which accepts the array and an integervalue as input. It checks the array for the value and returns trueif the value exists, false if it does not.d) Implement a randArray function which initializes the array with randomintegers between 0 and 9 inclusive. This function should use thehasValue function to ensure all values are unique (no duplicates).e) Print the array. Confirm that all values (0-9) are included. Example 1 Output (input in bold italics) 2 5 8 9 3 4 0 1 7 6Example 2 Output (input in bold italics)5 9 3 4 7 0 1 6 2 8
3. Implement a function called findLargestIndex which returns the index of the rowwith the largest sum.ex. int array[3][6] = {{3, 6, 8, 2, 4, 1}, // sum = 24{2, 4, 5, 1, 3, 4}, // sum = 19{1, 0, 9, 0, 1, 0}}; // sum = 11If the findLargestIndex function was called using this array, it would return 0, asit is returning the index of the row, not the sum.Note that the number of columns is required when passing a 2d array to a function.Assume that 2D arrays passed to this function will have 6 columns.Title line: int findLargestIndex(int array[][6], int rows, int columns);
ALGO1(A)// A is an integer array, an index that starts at 11): for i=1 to n-1 do2): minIndex = findSmallest(A,i)3): exchange A[i] with A[minIndex] The sub-routine find the smallest(A, i) in Line 2, and returns the index of the smallest element in thesub-array A[i:n]Suppose the array below is provided as input to ALGO1 2 5 6 7 3 8 1 4 Fill in the Blanks At the end of the first iteration of the for loop (i.e. with i=1)1) a) the element at index 1 is : b) the element at index 4 is :   c) the element at index 7 is :
// 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…
Java Quick Sort but make it read the data 10, 7, 8, 9, 1, 5 from a file not an array // Java implementation of QuickSort import java.io.*;    class GFG {        // A utility function to swap two elements     static void swap(int[] arr, int i, int j)     {         int temp = arr[i];         arr[i] = arr[j];         arr[j] = temp;     }        /* This function takes last element as pivot, places        the pivot element at its correct position in sorted        array, and places all smaller (smaller than pivot)        to left of pivot and all greater elements to right        of pivot */     static int partition(int[] arr, int low, int high)     {            // pivot         int pivot = arr[high];            // Index of smaller element and         // indicates the right position         // of pivot found so far         int i = (low - 1);            for (int j = low; j <= high - 1; j++) {                // If current element is smaller             // than the pivot             if…
solve in python coding 3. Selection Sort• The idea in a selection sort is that you locate the largest item out of a set ofunsorted items, and move it into position at the end of the unsorted items. Asorted region grows one item at a time, while an unsorted region shrinks.• As done in Part 1, fill an array with random numbers.• Write a function that locates the largest element in the portion of the arraybeginning at the start of the array, up to a given index, and swaps the largestitem with the item at the given index.• E.g. If searching a[0] to a[7] locates the largest item at a[4], a[4] and a[7] would beswapped.• Write a second function that calls the first function repeatedly, until the entirearray is sorted. (Each time the first function is called, it will search one fewerelement)
Java Program. Write a function that returns the index of the smallest element in an array of doubles. If there are more such elements than one, return the last index is fine. Using the following header: int IndexOfSmallestArray(double array[], int size) Finish the function implement only.
3. Selection Sort• The idea in a selection sort is that you locate the largest item out of a set ofunsorted items, and move it into position at the end of the unsorted items. Asorted region grows one item at a time, while an unsorted region shrinks.• As done in Part 1, fill an array with random numbers.• Write a function that locates the largest element in the portion of the arraybeginning at the start of the array, up to a given index, and swaps the largestitem with the item at the given index.• E.g. If searching a[0] to a[7] locates the largest item at a[4], a[4] and a[7] would beswapped.• Write a second function that calls the first function repeatedly, until the entirearray is sorted. (Each time the first function is called, it will search one fewerelement)
Create two dynamic arrays A and B with random numbers.a) Merge B in array A calling a function by reference.b) Delete the Prime numbers from the merged array A calling a function by pointer.c) Print the Array A in ascending order.You have to use only two Arrays A and B throughout the code. Be carefulabout memory leakage.Example:A= [20, 30, 5, 7, 19]B= [19, 10, 15, 11, 17, 25] a) After merging B in A, the merged Array A will look like-A= [20, 30, 5, 7, 19, 19, 10, 15, 11, 17, 25] b) After deleting prime numbers the merged Array would look like-A= [20, 30, 10, 15, 25] c) Finally print the merged array in ascending orderA= [10, 15, 20, 30, 25] In C++ Please
1. You have an array of 4 ints which is sorted from lowest to highest. You also have a function which runs a bubble sort to sort items from lowest to highest. If you run this function on your array, the function will do at least one swap. A) True B) False
Create a function that returns the majority vote in an array. A majority vote is an element that occurs > N/2 times in an array (where N is the length of the array).