Here is the code of bubble sort. Its run time complexity is 8(n²). Change the code in a way so that its time complexity is 8(n) for the best-case scenario. You have to explain how you have achieved the 8(n) for the best-case scenario in a comment block of your code. def bubbleSort(arr): for i in range(len(arr)-1): for j in range(len(arr)-i-1): if arr[j] > arr[j+1]: arr[j], arr[j+1] = arr[j+1], arr[j] Input 1: 5 32145 Input 2: 6 5 10 15 20 25 30 Output 1: 12345 Output 2: 5 10 15 20 25 30 For the input 2, your code should run at 8(n). Please note, you have to take the input from an input3.txt file, and show the output in an output3.txt file.

Here is the code of bubble sort. Its run time complexity is 8(n²). Change the code in a way so that its time complexity is 8(n) for the best-case scenario. You have to explain how you have achieved the 8(n) for the best-case scenario in a comment block of your code. def bubbleSort(arr): for i in range(len(arr)-1): for j in range(len(arr)-i-1): if arr[j] > arr[j+1]: arr[j], arr[j+1] = arr[j+1], arr[j] Input 1: 5 32145 Input 2: 6 5 10 15 20 25 30 Output 1: 12345 Output 2: 5 10 15 20 25 30 For the input 2, your code should run at 8(n). Please note, you have to take the input from an input3.txt file, and show the output in an output3.txt file.

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 help with the bolded functions: I need to implement the following two functions that get a string, and compute an array of non-empty tokens of the string containing only lower-case letters. For example:● For a string "abc EFaG hi", the list of tokens with only lower-case letters is ["abc", "hi"].● For a string "ab 12 ef hi ", the list of such tokens is ["ab","ef","hi"].● For a string "abc 12EFG hi ", the list of such tokens is ["ab","hi"].● For a string " abc ", the list of such tokens is ["abc"].● For a string "+*abc!! B" the list of such tokens is empty. That is, we break the string using the spaces as delimiters (ascii value 32), and look only at the tokens with lower-case letters only . Q1. The function count_tokens gets a string str, and returns the number ofsuch tokens. int count_tokens(const char* str); For example:● count_tokens("abc EFaG hi") needs to return 2.● count_tokens("ab 12 ef hi") needs to return 3.● count_tokens("ab12ef+") needs to return 0. Q2. The function…
Please use Java for the solution
I need to write a Java ArrayList program called Search.java that counts the names of people that were interviewed from a standard input stream. The program reads people's names from the standard input stream and from time to time prints a sorted portion of the list of names. All the names in the input are given in the order in which they were found and interviewed. You can imagine a unique timestamp associated with each interview. The names are not necessarily unique (many of the people have the same name). Interspersed in the standard input stream are queries that begin with the question mark character. Queries ask for an alphabetical list of names to be printed to the standard output stream. The list depends only on the names up to that point in the input stream and does include any people's names that appear in the input stream after the query. The list does not contain all the names of the previous interviews, but only a selection of them. A query provides the names of two people,…
Write a program sorta that sorts and prints its arguments. sorta takes zero or more arguments,sorts them lexicographically, and then prints each argument on its own line.If sorta receives no arguments, it should exit without printing anything.You are free to use any sorting algorithm you find convenient, but sorta MUST use strcmp()for string comparison. Note that strcmp() uses lexicographical ordering (so a string comes afterits prefix) based on ASCII comparison of characters (so ‘Z’ comes before ‘a’). (See man strcmp for usage information.) Treat the arguments (excluding argv[0]) as given: make no attempt to process or otherwise normalize the strings before sorting. Note that your shell will perform some manipulation on your input before passing the strings to your program, and most punctuation marks have special meanings: use escape sequences and/or quotation marks to avoid this. Program should not assume that it has received the proper number of arguments, for example, butshould…
For JAVA.
code in java onlyy
Implement substringList() that will produce the collection of words from the 1D array B that has substrings equivalent to the string key. The resulting collection should be stored in array C and this should contain only the unique set of words. The function returns the resulting total number of elements in array C. For your reference, a substring is a contiguous sequence of characters within a string. As an example, the strings “app”, “ppl”, “apple”, and “e” are among the substrings from the string “apple”. But, strings “ale” are “elppa” are not substrings from string “apple”. key = "or" array B = {"it's", "today", "now", "or", "forever", "today", "ACT"} array C should be {"or", "forever"} Rules: You can only use strcmp, strcat, and strcpy Maximize the use of loops (e.g., for) you can create local variables that can aid you
Please help. How to solve this on Java language by using only Dynamic Programming? Thank you. We are given a set A of integers. Check whether we can partition A into three subsets with equal sums. It is important to note that all elements should be included in the equally divided subsets; no element should be left out, and none of the elements should be repeated in the subsets.For example: A={4,7,6,2,10,7,10,2} has such a partition: {4,2,10}, {7,7,2},{6,10}Input: A set, A, of integersOutput: if we can partition A into three subsets with equal sums, print subsets otherwise present a suitable message.
Given an array with n objects colored red,white or blue, sort them so that objects of the same colorare adjacent, with the colors in the order red, white and blue. Here, we will use the integers 0, 1, and 2 to representthe color red, white, and blue respectively. Note:You are not suppose to use the library's sort function for this problem.""".
Write an c progra, that takes an array of N integers (N will be specified by the user at run time). It then finds how many numbers in the array are divisible by 3 and how many numbers are divisible by 7. the it copies, from the input array above, the numbers that are divisible by 3 into a new array and those divisible by 7 into a different new array. Once copied, the algorithm should compute the average of each of these two new arrays and print the averages on the screen with suitable message to let the user know which average is being printed Note: an integer number is divisible by 3 (respectively 7) if the remaining of its division by 3 (respectively 7) is 0. You are allowed to use the modulus operator %.
PROGRAM IN C++ Our BoardArray will store 5 entries maximum. Improve the following existing methods: bool add(entry* e) Improve the add method where you will return true if the entry has been successfully added (i.e. the entry is placed in the top 10), otherwise return false (i.e. if the entry did not make it to the top 10). bool remove(const char* person) Improve the remove method where you return true if an entry is successfully deleted (i.e. we have found an entry that matches the person), otherwise return false. Add the following additional methods: bool ban_country(const char* nation) Removes all the entries bearing the country equal to the given nation. Return true if at least one entry has been removed, otherwise return false. int country_wins(const char* nation) Returns the number of entries in the scoreboard who represents the given nation. int exemplary(int score) Returns how many entries in the scoreboard are greater than or equal to the given score. double…
//From what I can tell, the answer provided does not answer my question. Asking again. Please read. Write a Java program that implements both Linear Search and Binary Search. The program willtake a collection of objects (generic type data) as input and print the number of comparisons neededto find a target element within that collection.You will create the following two Java classes:1. SearchCombo.java : Code for both linearSearch and binarySearch will be in this class. Youmay take help from the textbook Chapter 9, Section 9.1. However, note that the design require-ments are different from the textbook code.•Both search methods must use the Comparable<T> interface and the compareTo() method.•Your program must be able to handle different data types, i.e., use generics.•For binarySearch, if you decide to use a midpoint computation formula that is different fromthe textbook, explain that formula briefly as a comment within your code. 2. Tester.java : This class will contain…