Below is the algorithm of Selection sort: for (index = 0; index < length - 1; index++) 1. Find the location, smallestIndex, of the smallest element in list[index]...list[length - 1]. 2. Swap the smallest element with list[index]. That is, swap list(smallestIndex) with list[index]. Sort the following list using Selection sort. Show the list after the fifth iteration of the outer loop: 26, 45, 17, 65, 33, 55, 12, 18 • 12, 17, 18, 26, 33, 55, 45, 65 • 12, 17, 18, 26, 33, 45, 65, 55 • 26, 45, 17, 65, 33, 55, 12, 18 • 17, 26, 45, 65, 33, 55, 12, 18 12, 17, 18, 26, 33, 55, 65, 45 • 12, 17, 18, 65, 33, 55, 26, 45 • 17, 26, 33, 45, 65, 55, 12, 18

Below is the algorithm of Selection sort: for (index = 0; index < length - 1; index++) 1. Find the location, smallestIndex, of the smallest element in list[index]...list[length - 1]. 2. Swap the smallest element with list[index]. That is, swap list(smallestIndex) with list[index]. Sort the following list using Selection sort. Show the list after the fifth iteration of the outer loop: 26, 45, 17, 65, 33, 55, 12, 18 • 12, 17, 18, 26, 33, 55, 45, 65 • 12, 17, 18, 26, 33, 45, 65, 55 • 26, 45, 17, 65, 33, 55, 12, 18 • 17, 26, 45, 65, 33, 55, 12, 18 12, 17, 18, 26, 33, 55, 65, 45 • 12, 17, 18, 65, 33, 55, 26, 45 • 17, 26, 33, 45, 65, 55, 12, 18

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

A gap sort is a version of the bubble sort method that compares items that are some number i places away, where i is an integer smaller than n, rather than neighbouring elements each time across the list. For example, the first element would be compared to the (i + 1) element, the second element to the (i + 2) element, the nth element to the (n - i) element, and so on. When all of the items that may be compared have been compared, a single iteration is accomplished. On the following iteration, i is reduced by a value bigger than one, and the procedure is repeated until i is less than one. Utilise a gap kind.
Implement bucket sort with an array of lists data structure to sort i) a list ofstrings, ii) a list of floating point numbers and iii) a list of integers, which areuniformly distributed over a range, for an appropriate choice of the number of buckets.need detailed solution with code otherwise you will get downvote
Suppose that a list contains the values 20, 44, 48, 55, 62, 66, 74, 88, 93, 99 at index positions 0 through 9. Trace the values of the variables left, right, and midpoint in a binary search of this list for the target value 90. Repeat for the target value 44. [only analytical work is required, no code is necessary; meaning just work the problem out and explain methods. thx :) ]
Consider a singly linked list data structure as show below, implement the most efficient algorithm to detect whether the elements in the list form a palindrome or not, the method must return true/false accordingly. class SinglyList: class _Node: def __init__(self, e, next): self._element = e self._next = next def __init__(self): self._head = self._tail = None def is_palindrome(self)->bool:
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).
Let L=(X1, X2Xn) be a list of n elements. Let us search for a key K in the list L. If the key is presented in the list L at index(or position); then partition the list Linto disjoint lists L1 and L2 such that L1=(x[i]: x[i]EL such that isj) and L2=(x[1]:x[i] EL such that i>j). If the key is not present in the list output is "no". Write an algorithm (using linked list) and subsequent C program for your algorithm to compute lists L1 and L2 for the given list L and key K. Note: Don't use any inbuilt functions in your program. Example1: If L=(16, 15, 1, 27, 19, 100, 200,3) and key k= 27 then L1=(16, 15,1,27) and L2=(19, 100,200, 3). Example 2: If L=(16, 15, 1, 27, 19, 100, 200,3) and key k= 127 then no. Input format Enter the list size n Enter the n numbers Enter the key value
Write a program to add scores of students. Ask the user to keep entering until the user types‘0’ to stop entering any more.The program should store the scores into an ArrayList.At the end:- First display all the scores entered,- Then sort the list using Collections.sort(name of the list)- Display the sorted list.
For this exercise, a list of non-negative numbers will be given, for which the following operation can be done: subtract 1 from two contiguous elements from the list. It must say whether after any number of operations the list can be converted to a list of zeros. EntryThe input will be a list of non-negative integers x_i such that 0 <= x_i <= 2000000000. ". DepartureIf the given list can be converted to a list of zeros with the operation defined above, print "YES", otherwise, print "NO". Examples Input Example 1 1 2Output Example 1 NOT Input Example 2 2 4 2Output Example 2 YES
Implement bucket sort with an array of lists data structure to sort i) a list ofstrings, ii) a list of floating point numbers and iii) a list of integers, which areuniformly distributed over a range, for an appropriate choice of the number ofbuckets.
There is a variation of the bubble sort algorithm called a gapsort that, rather than comparing neighboring elements eachtime through the list, compares elements that are some numberi positions apart, where i is an integer less than n. For example,the first element would be compared to the (i + 1) element, thesecond 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 theelements that can be compared, have been compared. On thenext iteration, i is reduced by some number greater than 1and the process continues until i is less than 1. Implement agap sort.
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.
simulate Cantor’s diagonalization argument. Using a pool of 5-letter words, build a 5 by 5 matrix in which each row is part of the list you are to compare. You are comparing the word that is extracted from the diagonal and each letter is replaced with the shifted letter.