Assume nums is an array of integers that looks like this: If we are sorting from smallest to largest, what will nums look like after 2 times through the outside loop if we are using bubble sort? Note: When you're entering the values, make sure you leave at least one space between them. Would it be possible to perform a linear search on a 2-D array? Answers: Yes, but you would be limited to using only one loop No, because a 2-D array is not stored in linear fashion in RAM Yes, as long as you used the proper nested loops No, you would have to use a binary search Yes, but only if the array's elements were sorted

Assume nums is an array of integers that looks like this: If we are sorting from smallest to largest, what will nums look like after 2 times through the outside loop if we are using bubble sort? Note: When you're entering the values, make sure you leave at least one space between them. Would it be possible to perform a linear search on a 2-D array? Answers: Yes, but you would be limited to using only one loop No, because a 2-D array is not stored in linear fashion in RAM Yes, as long as you used the proper nested loops No, you would have to use a binary search Yes, but only if the array's elements were sorted

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

How could i make an array that lets say has every month then i have another array that has a double for each element. How can i have the string array print out the value element i want in the string with the double num from the other array? would i just use to for loops are is there a way to accomplish that?
You are now running the insertion sort algorithm on your computer. Assume that at the start of iteration j=4 of the for loop, the array A is A=3,6,8,4,9,2,7,10, and that the for loop is iteration j=4. The array A should be written at the beginning of iteration j=5 of the for loop.
Two words (spelt in uppercase) are similar if and only if all letters in the 1st word are in the 2nd word and all letters in the 2nd word are in the 1st word; including the same number of duplications. For example, ABBA and BABA are similar; however, BABA and BAAA are not similar. To check two words which are similar, we can use two integer arrays, each has 26 elements (as we have 26 letters), you can assume that 1st array element stores the number of letter 'A', 2nd array element stores the number of letter 'B', and so on. What you need to do now is to check whether the two integer arrays are equal to decide whether the two words are similar. We propose following UML for this question: O TwoWords - String word1 -String word2 O Exam_Q4 +TwoWords0 - static Scanner input +TwoWords(String word1, String word2) O+TwoWords(TwoWords tw) O+ String getWord10 O+ static void main(String args) O+ String getWord20 O+void setinfo(String word1, String word2) O -intj countinfo (String word) O+boolean…
A simple improvement to the Insertion Sort code we looked at is to get rid of the calls to “Swap”, and instead do the following: Pull the value to be inserted out of the array and into a variable “toBeInserted”, move elements of the array to the right as long as they are larger than “toBeInserted”, then move “toBeInserted” into the open space in the array. Note that “toBeInserted” may be a substantial object or record, and hence not able to fit into a register variable. Imitate my analysis of Insertion Sort (that used the swap method) with this algorithm. How much better is this revised algorithm than the one I analyzed? Justify your answer.
A majority element is an element that makes up more than half of the items inan array. Given a positive integers array, find the majority element. If there is no majority element,return -1. Do this in O(N) time and 0(1) space.Input: 1 2 5 9 5 9 5 5 5Output: 5
What is the worst case running time for finding the kth value in an array?
Suppose an array has n elements. This _____ sorts to sort and array works as follows: Find the smallest element and place it in the first position. Then find the smallest of the remaining n-1 elements and place it in the second position. Repeat on n-2 elements, n-3 elements, ..., until the array is sorted.
Double Insertion Sort is a variation on Insertion Sort that works from the middle of the array out. At each iteration, some middle portion of the array is sorted. On the next iteration, take the two adjacent elements to the sorted portion of the array. If they are out of order with respect to each other, then swap them. Now, push the left element toward the right in the array so long as it is greater than the element to its right. And push the right element toward the left in the array so long as it is less than the element to its left. The algorithm begins by processing the middle two elements of the array if the array is even. If the array is odd, then skip processing the middle item and begin with processing the elements to its immediate left and right. Implement Double Insertion Sort, being careful to properly handle both when the array is odd and when it is even. By using java, Implement the Double Insertion sort algorithm on a randomly generated list of N integer numbers. Your…
Double Insertion Sort is a variation on Insertion Sort that works from the middle of the array out. At each iteration, some middle portion of the array is sorted. On the next iteration, take the two adjacent elements to the sorted portion of the array. If they are out of order with respect to each other, then swap them. Now, push the left element toward the right in the array so long as it is greater than the element to its right. And push the right element toward the left in the array so long as it is less than the element to its left. The algorithm begins by processing the middle two elements of the array if the array is even. If the array is odd, then skip processing the middle item and begin with processing the elements to its immediate left and right. Implement Double Insertion Sort, being careful to properly handle both when the array is odd and when it is even. Implement the Double Insertion sort algorithm by using JAVA on a randomly generated list of N integer Your program…
you are given integers A = [a0, a1, a2, · · · an], where a are integers. We want to determine the largest sum of a portion of consecutive values in the array. array A = [3, 13, −20, 9, −3, 30, 9, −70], largest sum of a portion of consecutive values is 9-3+30+9 = 45. a) you must write an iterative algorithm that can determine the largest sum of a portion of consecutive values / show the time complexity b)Write a dynamic programming-based algorithm that determines the largest sum of a portion of consecutive values/show its time complexity
do not plagiarise
Solve this question please ??