10 11 12 13 insertion_Sort(A, n); printf("The sorted array is: "); 14 15 16 17 -0-0 for (int i = 0; i < 6; i++) { if (i == 5) { printf("%d", A[i]); printf(" } 18 else 19 20 } 21 22 return 0; 23 } 24 25 26 27 int j; 28 int i; 29 3 3 30 31 = key i = A[i]; 1; ✔ No issues found void insertion_Sort( int key; Exception Thrown Exception thrown at 0x00007FF62DB018AA in Algorithms Testing2.exe: 0xC0000005: Access violation reading location Show Call Stack | Copy Details | Start Live Share session... Exception Settings Break when this exception type is thrown Except when thrown from: Algorithms Testing2.exe Open Exception Settings Edit Conditions for (i = 2; i <= n / 1++) { h (Ctrl+E) ne ЭА Si key n Search Depth: 3 Value 0x00000000feeff5d8 {???} 2 0 32758 6 Type int * int int int int - дх Output ДХ Show output from: Debug 'Algorithms Testing2.exe' (Win32): Loa 'Algorithms Testing2.exe' (Win32): Loa 'Algorithms Testing2.exe' (Win32): Loa 'Algorithms Testing2.exe' (Win32): Loa 'Algorithms Testing2.exe' (Win32): Loa 'Algorithms Testing2.exe' (Win32): Loa The thread 0x1940 has exited with code Exception thrown at 0x00007FF62DB018AA

10 11 12 13 insertion_Sort(A, n); printf("The sorted array is: "); 14 15 16 17 -0-0 for (int i = 0; i < 6; i++) { if (i == 5) { printf("%d", A[i]); printf(" } 18 else 19 20 } 21 22 return 0; 23 } 24 25 26 27 int j; 28 int i; 29 3 3 30 31 = key i = A[i]; 1; ✔ No issues found void insertion_Sort( int key; Exception Thrown Exception thrown at 0x00007FF62DB018AA in Algorithms Testing2.exe: 0xC0000005: Access violation reading location Show Call Stack | Copy Details | Start Live Share session... Exception Settings Break when this exception type is thrown Except when thrown from: Algorithms Testing2.exe Open Exception Settings Edit Conditions for (i = 2; i <= n / 1++) { h (Ctrl+E) ne ЭА Si key n Search Depth: 3 Value 0x00000000feeff5d8 {???} 2 0 32758 6 Type int * int int int int - дх Output ДХ Show output from: Debug 'Algorithms Testing2.exe' (Win32): Loa 'Algorithms Testing2.exe' (Win32): Loa 'Algorithms Testing2.exe' (Win32): Loa 'Algorithms Testing2.exe' (Win32): Loa 'Algorithms Testing2.exe' (Win32): Loa 'Algorithms Testing2.exe' (Win32): Loa The thread 0x1940 has exited with code Exception thrown at 0x00007FF62DB018AA

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter6: Arrays

Section: Chapter Questions

Problem 19RQ

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…
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.
Java-.Selection and insertion sort 3.a Show steps of selection sort for the given array. You may need to add more rows to the table. Selection Sort Initial value 3 2 7 5 4 8 9 10 1 Search 0 . . . end 3 2 7 5 4 8 9 10 1 Swap index 0 Search 1 . . . end . . . 3.b Show steps of insertion sort for the given array. You may need to add more rows to the table. Insertion Sort Initial value 3 2 7 5 4 8 9 10 1 , first item is sorted 3 2 7 5 4 8 9 10 1 , first 2 items are…
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 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…
1-D Arrays Using only one 1-D array (list) with 10 random integer elements, write a complete java program that will arrange (sort) the elements in ascending manner (from smallest to the largest). You must use the swap algorithm below. swap algorithm: value1 = value 1 + value2; value2 = value1 - value2; value1 = value1 - value2;
In C Program (Insertion Sort) Write a program that sorts the values inside the array in ascending order using the insertion sort algorithm. Print out the sorted values inside the pair of square brackets [ ] where the elements are separated by a comma and a space ", " An initial code is provided for you. Just fill in the blanks. Output [1, 2, 3, 4, 5]
solve this by c programming Write a program that deletes the first element in an array which matches a search key. Andprint the new array after deletion.
Sorting is a basic issue with arrays in which the goal is to find the target element in the array. Choose from the following options: False
in java ecplise . Implement a program that randomly generates 10 integers from -100 to 100,stores them in a 1D array, and finds their maximum value. Calculate theexecution time of finding a maximum. Repeat the test for 10,000 and10,000,000 numbers. Provide your results in the form of a table below andprovide a small summary. Implement a Java program that will populate a 5x5 matrix with randomlygenerated integers from 0 to 100.(1) print your matrix in a table form.(2) modify your code to multiply all even numbers by 10 and print the matrix.Your output of questions (1) and (2) should match the format of the followingsample outputs:
int g(int nums[], int n) { if (n == 1) return 0; int val = g(nums, n-1); if (nums[n-1] > nums[val]) return val; return n-1; } Give a recurrence T(n) for the number of times the code nums[n-1] > nums[val] is executed when the array values are in ascending order. Then solve the recurrence
(Recursive Selection Sort) A selection sort searches an array looking for the smallest elementin the array. When that element is found, it’s swapped with the first element of the array. The process is then repeated for the subarray, beginning with the second element. Each pass of the arrayresults in one element being placed in its proper location. This sort requires processing capabilitiessimilar to those of the bubble sort—for an array of n elements, n – 1 passes must be made, and foreach subarray, n – 1 comparisons must be made to find the smallest value. When the subarray beingprocessed contains one element, the array is sorted. Write a recursive function selectionSort toperform this algorithm