13Problem 1BIn this problem we want to do an "in-place" sorting, that is, given an unsorted array, sort the array directly,by swapping elements on the array, without using and returning another array.Here is the main idea: first scan through the original input array from index 0 to the end, finding the smallestelement. This element should be the first element of the sorted array. To make it the first element of the array, thealgorithm swaps the smallest element with the element at index 0. Now, subarray at index 0 is considered the sortedarray, and the rest is unsorted. Next, scan through the unsorted part of the array, from index 1 to the end,finding the smallest element in the range. Then make it the 2nd element of the array by swapping it with the elementat index 1. Now subarray at index 0 and index 1 are sorted, and the rest are unsorted. Next, scan through the unsortedpart of thepart of the array from index 2 to the end, finding the smallest element and put it as the 3rd element of the array.Repeat the process until no more unsorted subarray exists. Following figure shows the steps of sorting an array.swap.2972 981387 66 52513613 is smallest-swap1372982987665251 3629 is smallestswapIn each iteration,subarray to the leftof the orange132998728766 52 513636 is smallestswap.13 2936728766 525198S1 is smallestswapelement is sorted.7298S2 is smallestFrom orange13293651876652no swapelement to the end87 72 9866 is smallestno swappingis the unsortedsubarray2936515266Ldems-13 2936 51 52 6687729872 is smallestno swap9852 66 | 72 |8787 is smallestno swapping13 2936 5113 2936 5152 66728798sorting completed Develop flowchart for this in-place sorting algorithm,Hint: you will need nested loops for doing the work in one algorithm.For swapping two elements, create a variable temp to hold one of the values temporarily.Save the flowchart as img_01B.jpg• Implement the algorithm using JavaScriptComplete function problemlB() in JS file, attach the onclick event to the corresponding html buttonYour implementation should match your flowchartSample output (each run will generate a different input array)49,71,85,19,29,43,20,78,29,4019,20, 29, 29, 40, 43, 49,71, 78,85problem1A- aroy sortproblem18 array sort [in-place]problermB array searchproblem3A-- string compare (same length]problem38 string compare

In this problem we want by swapping elements o Here is the main idea: fi element. This element sl algorithm swaps the sma part of the array, and the finding the smallest eler at index 1. Now subarra part of the array from in Repeat the process until

In this problem we want by swapping elements o Here is the main idea: fi element. This element sl algorithm swaps the sma part of the array, and the finding the smallest eler at index 1. Now subarra part of the array from in Repeat the process until

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

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)
4. Write a program to find kth smallest element in unsorted array?You are given an unsorted array of numbers and k, you need to find the kth smallest number in the array. Forexample if given array is {1, 2, 3, 9, 4} and k=2 then you need to find the 2nd smallest number in the array,which is 2.
6. Read in two integers n and m (n, m < 50). Read n integers in an array A. Read m integers in anarray B. Then do the following (write separate programs for each, only the reading part iscommon).a) Find if there are any two elements x, y in A and an element z in B, such that x + y = z.b) Copy in another array C all elements that are in both A and B (intersection).c) Copy in another array C all elements that are in either A and B (union).d) Copy in another array C all elements that are in A but not in B (difference).Do In c Program
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);
Binary Search in descending order We have learned and practiced the implementation of the binary search approach that works on an array in ascending order. Now let’s think about how to modify the above code to make it work on an array in descending order.
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)
4. Insertion Sort• The idea with an insertion sort is that a sorted region grows one item at atime, by inserting an item into its correct position within the sorted region.• As done in Part 1, fill an array with random numbers.• Write a function that inserts an item into a sorted region of an array. Passthe function the index of the item to be inserted (i.e. the index of the firstitem in the unsorted region). Insert that item by shifting items over oneposition, until you have found the correct location to insert the item.• E.g. if given a = [2 5 8 9 6 3 7] and the index 4, a[4] should be inserted into thesorted portion, giving [2 5 6 8 9 3 7]• Write a second function that calls the first function repeatedly, until theentire array is sorted. (Each time the first function is called, it will insert anitem into a larger sorted region.)
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…
1. Write a code to sort the following arrays using selection sort method. [10, 34, 2, 56,7,67, 88, 42] 2. Write a code to sort the following arrays using bubble sort method. [10, 34, 2, 56, 7, 67, 88, 42] 3. One possible improvement for Bubble Sort would be to add a flag variable and a test that determines if an exchange was made during the current iteration. If no exchange was made, then the list is sorted and so the algorithm can stop early. This makes the best case performance become O(n) (because if the list is already sorted, then no iterations will take place on the first pass, and the sort will stop right there).Modify the Bubble Sort implementation to add this flag and test. Compare the modified implementation on a range of inputs to determine if it does or does not improve performance in practice.
2. Search and Rescue by CodeChum Admin Make a program that will accept an integer and loop for the same number of times as that of the inputted integer and input random integers and add it to the array/list one by one, per line. Afterwards, make your program accept another random integer. Using that final integer, compare from your array/list if the final integer's value is also present in your current array/list. If so, print "Present"; otherwise, print "None". Start coding now! Input The first line contains the size of the array/list. The next lines contain the integers. The last line contains an integer to be searched. 5 3 21 2 5 23 2 Output A line containing a string. Present -USED JAVA PROGRAMMING LANGUAGE
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
(Bubble Sort) Implement the bubble sort—another simple, yet inefficient, sorting technique. It’s called bubble sort or sinking sort because smaller values gradually “bubble” their way to the top of the array (i.e., toward the first element) like air bubbles rising in water, while the larger values sink to the bottom (end) of the array. The technique uses nested loops to make several passes through the array. Each pass compares successive overlapping pairs of elements (i.e., elements 0 and 1, 1 and 2, 2 and 3, etc.). If a pair is in increasing order (or the values are equal), the bubble sort leaves the values as they are. If a pair is in decreasing order, the bubble sort swaps their values in the array. The first pass compares the first two elements of the array and swaps them if necessary. It then compares the second and third elements. The end of this pass compares the last two elements in the array and swaps them if necessary. After one pass, the largest element will be in the last…