Suppose we have a new sorting algorithm that works as follows. Given array x, start at index i=0and perform the following steps:1. if i=0, increment i, return to step 12. if i==len (x), stop (the list is sorted)3. if x[i] < x[i-1], swap them, and decrement i, return to step 14. if x[i] 2 x[i-1], simply increment i, return to step 1For example, if we were sorting [4, 3, 21, the steps would be:actioni1-0i=0, so increment ii=1x[1]i-0, increment ix[1]x [0], so simply increment ix [2] < x[1], so swap and decrement iarray[4, 3, 2][4, 3, 2][3, 4, 21[3, 4, 21[3, 4, 21[3, 2, 41[2, 3, 4][2, 3, 4][2, 3, 4][2, 3, 4]1-01-11-21-1i=0i-1i=2i=3x [0], so swap and decrement ix[1] < x[0], so swap and decrement ii-0, increment ix[1]> x[0], so simply increment ix [2] > x[1], so simply increment ilist is sorted!For an array of length n, what is the approximate average complexity of this sort algorithm? Inother words, what is the order (big-O notation) that best describes the typical number of swaps,as a function of n, expected in this algorithm. Show your work and/or thoroughly explain youranswer. Lucky guesses will be marked zero.

I have solved the answer below:

1. if i=0, increment i, return to step 1 2. if i==len (x), stop (the list is sorted) 3. if x[i] < x[i-1], swap them, and decrement 1, return to step 1 4. if x[i] 2 x[i-1], simply increment i, return to step 1 For example, if we were sorting [4, 3, 21, the steps would be: array [4, 3, 2] 14. 3. 21 i 1-0 1-1 action 10, so increment i x[11 < x101. so swap and decrement i

1. if i=0, increment i, return to step 1 2. if i==len (x), stop (the list is sorted) 3. if x[i] < x[i-1], swap them, and decrement 1, return to step 1 4. if x[i] 2 x[i-1], simply increment i, return to step 1 For example, if we were sorting [4, 3, 21, the steps would be: array [4, 3, 2] 14. 3. 21 i 1-0 1-1 action 10, so increment i x[11 < x101. so swap and decrement i

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

Please answer it in Python Write a function pairsbypairslist that would return pair by pair from the smallest value to the biggest value For example [12, 13, 11, 15], # return : (11, 12) and (13, 15) [9, 15, 4, 24, 19, 2] # return : (2,4) (9,15) (19,24) [1, 5, 9, 15, 21, 9, 12, 9], # return : (1,5) (9,9) (9,12) (15,21)
A singly linked list contains n - 1 strings that are binary representations of numbers from the set {0, 1,.…, n – 1} where n is an exact power of 2. However, the string corresponding to one of the numbers is missing. For example, if n = 4, the list will contain any three strings from 00, 01,10 and 11. Note that the strings in the list may not appear in any specific order. Also note that the length of each string is lgn, hence the time to compare two strings in O(lgn). Write an algorithm that generates the missing string in O(n).
A linked list has a cycle such that if you start at any node p and follow a sufficient number of subsequent links, you will end up at node p. Not that p does not have to be the list's initial node. Assume you are given an N-node linked list. The value of N, on the other hand, remains unknown. 1. Create an O(N) algorithm to check if a list includes a cycle. You may add O(N) more spaces. 2. Rep the previous question, this time using just O(1) more space. (Hint: Use two pointers that start at the beginning of the list but progress at separate rates.)
Let I be a list of integers. Below, there are four expressions that involve the list I. Without even knowing the contents of I, match the expressions to the lists that were evaluated from them. [sum (1[:i]) for i in range (len(1))] Choose. Choose. [1[0] for i in enumerate (1)] [0, 1, 2, 3, 4, 5, 6, 7, 8) fo, 49, 112, 148, 160, 251, 348, 366, 388] (1.7, 4, 4, 3, 1, 2, 6, 2] [97, 91, 63, 58, 49, 36, 22, 18, 12] [1776, 3162, 840, 0, 7110, 8160, 102, 210, 2622] [sorted (1) (i] for i in [8,7,6,5,4,3,2,1,01] [118 for i in 1] Choose. (1**2-13*1+12 for i in 1] Choose.
7. display a value at a specified index in a linked chain of integers For example, display the 3rd element in the chain, display the 10th element in the chain, etc. a.O(log n) b.O(n2) c.O(n) d.O(1) e.none of these is correct
There are two n-element arrays A and B the task is to permute them such that A[i]+b[i]>=k Can someone walk me through the code. I dont understand the iList and jList and why we have if j and i not in List we do List.append. Also at the end why we do if len(iList)+len(jList)==len(A)+len(B) ? def twoArrays (k, A, B): A.sort() B. sort() iList = [] jList = [] for i in range (len (A)): for j in range (len (B)): if(A[i]+B[j]>=k): if j not in jList and i not in iList: iList.append(i) jList.append(j) print (iList) print (jList) if(len (iList) + len(jList) ==len (A) + len(B)) return "YES" else: return "NO"
Given the following list, List = [ 9, 2, 5, 1, 3, 7, 6, 8 ] What is the order of the list after 5 passes of insertion sort?
True or false: O(log n) is the worst-case run-time complexity of inserting a node into an AVL tree. True False
There is a variation of the bubble sort algorithm called a gap sort that, rather than comparing neighboring elements each time through the list, compares elements that are some number i positions apart, where i is an integer less than n. For example, the first element would be compared to the (i + 1) element, the second element would be compared to the (i + 2) element, the nth element would be compared to the (n - i) element, and so on. A single iteration is completed when all of the elements that can be compared, have been compared. On thenext iteration, i is reduced by some number greater than 1 and the process continues until i is less than 1. Implement a gap sort.
Sort the following list using the Selection Sort algorithm . Show the list after each iteration of the outer for loop (after each complete pass through the list) IMPORTANT: Separate each value by a comma and only one space after each comma and no space after the last value. You will have seven iterations of the list for your answer. 38, 60, 43, 5, 70, 58, 15, 10
A singly linked list can be reversed by altering the nodes' pointers. The original list's nodes should still contain the data that the list represents.For instance, if a single linked list START is supplied, as in Figure P6.9(a), the list must be reversed using just the links, as in Figure P6.9(b).
Q9. Deleting the last item in a doubly circular linked list takes ......... time compared to deleting the first item in it. More O Less O Same O None of them