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

design an algorithm to find all the common elements in two sorted lists of numbers. For example, for the lists 2, 5, 5, 5 and 2, 2, 3, 5, 5, 7, the output should be 2, 5, 5.What is the maximum number of comparisons your algorithm makes if the lengths of the two given lists are m and n, respectively?
The Quicksort algorithm based on divide and conquer algorithm. Explain the difference between it and merge sort. If the list has the following items 17 9 11 30 8 20 35 7 5 45 3 28
The bubble sort algorithm is used to sort the following sequence of integers: 3 32 19 41 27 20 7 •How many passes must the algorithm perform to guarantee the entire sequence is sorted?•What is the list obtained after the first pass?•What is the list obtained after the third pass?•What is the list obtained after the final pass? Please break this down in steps. Thank you!
Consider the algorithm given below. ALGORITHM MinDistance(A[0..n − 1]) //Input: Array A[0..n − 1] of numbers //Output: Minimum distance between two of its elements dmin←∞ for i ←0 to n − 1 do for j ←0 to n − 1 do if i != j and |A[i]− A[j ]| < dmin dmin ←|A[i]− A[j ]| return dminif n = 20, and the list is sorted in descending order, then the loop " or i ←0 to n − 1 do " will be executed ______ times.
3. Show how the binary search algorithm searches for 25 in the sorted listbelow: 4 6 17 25 32 39 41 43 45 49 let i = be the first number j = be the last number m = be the middle number I need to see how this is done and how the numbers narrow down to 25. Please break this down in described steps. I'm really confused.
Create an algorithm that demonstrates the Fibonacci search procedure. The number of data elements n is chosen in such a way that: I Fk+1 > (n+1); and ii) Fk + m = (n +1) for some m 0, where Fk+1 and Fk are two consecutive Fibonacci numbers.
Given an unsorted array of integers, find the length oflongest increasing subsequence.Example:Input: [10,9,2,5,3,7,101,18]Output: 4Explanation: The longest increasing subsequence is [2,3,7,101], therefore thelength is 4.Time complexity:First algorithm is O(n^2).Second algorithm is O(nlogx) where x is the max element in the listThird algorithm is O(nlogn)Space complexity:First algorithm is O(n)Second algorithm is O(x) where x is the max element in the listThird algorithm is O(n)""" def longest_increasing_subsequence(sequence): """ Dynamic Programming Algorithm for counting the length of longest increasing subsequence type sequence: list[int] rtype: int """ length = len(sequence) counts = [1 for _ in range(length)] for i in range(1, length): for j in range(0, i): if sequence[i] > sequence[j]: counts[i] = max(counts[i], counts[j] + 1) print(counts) return max(counts) def…
Consider the QuickSelect. This algorithm solves the problem of finding k-th smallest value in a given list A with length n. Below is a summary of the pseudocode for QuickSelect:(1) Pick a pivot element p at random from A and Split A into subarrays left and right by comparing each element to p as in Quicksort. While we are at it, count the number L of elements going in to left.
Suppose you are implementing a sorting algorithm and you want to compare its performance with another algorithm. The first algorithm takes 25 seconds to sort an input of size 10,000, while the second algorithm takes 45 seconds to sort the same input size. What is the ratio of the running times of the two algorithms?
a. Write a version of the sequential search algorithm that can be used to search a sorted list. (1, 2) b. Consider the following list: 2, 20, 38, 41, 49, 56, 62, 70, 88, 95, 100, 135, 145 Using a sequential search on ordered lists, that you designed in (a), how many comparisons are required to determine whether the following items are in the list? (Recall that comparisons mean item comparisons, not index comparisons.) (1, 2) 2 57 88 70 135 Write a program to test the function you designed. Note: Have the function,seqOrdSearch, return -1 if the item is not found in the list. (return the index of the item if found).
Write a pseudocode for a divide-and-conquer algorithm for finding theposition of the largest element in an array of n numbers.
The Quicksort algorithm based on divide and conquer algorithm. Explain the difference between it and merge sort. If the list has the following items17 9 11 30 8 20 35 7 5 45 3 28Apply the quick sort on the above list by using the pivot is always the left item and find the following The list after a first partition call The split point in the second partition call.