As we in general, try to solve the problem first; we start with a brute force, simple, algorithm: design it below # write your implementation here def maxProfitBrute(changes): it returns the indices of (i,j) indicating the day to buy and sell respectively to have the maximum profit in a list of prices per day in . Inputs: - changes: the list holding the changes in prices; the value whose index is k represents the change between day and day has at least a single change [two days] Output: - i: the index of the change before which we buy j: the index of the change after which we sell maxProfit: the value of the maximum profit Example: changes - [1,2] that means the price started with ; day 1: it became day 2: it became In that case: (i,j) = (0,1) as we should buy at the first day, and sell after the third day # return the values return (0,0,0)

As we in general, try to solve the problem first; we start with a brute force, simple, algorithm: design it below # write your implementation here def maxProfitBrute(changes): it returns the indices of (i,j) indicating the day to buy and sell respectively to have the maximum profit in a list of prices per day in . Inputs: - changes: the list holding the changes in prices; the value whose index is k represents the change between day and day has at least a single change [two days] Output: - i: the index of the change before which we buy j: the index of the change after which we sell maxProfit: the value of the maximum profit Example: changes - [1,2] that means the price started with ; day 1: it became day 2: it became In that case: (i,j) = (0,1) as we should buy at the first day, and sell after the third day # return the values return (0,0,0)

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

Writing a program in C++ that combines the three summations and linear search algorithm together in one code and there will be an improvement in the three summation algorithm performance? three summations 3-sum: brute-force algorithm Linear Search Algorithm publie elass Threesun • The linear search algorithm locates an item in a list by examining elements in the sequence one at a time, starting at the beginning. • First compare x with a,. If they are equal, return the position 1. • If not, try a,, If x = a, return the position 2. • Keep going, and if no match is found when the entire list is scanned, publie statie int count (int(] a) int N-a.length: int count- o: for (int i- 0; i
Consider the following problem:• Consider there are 10 persons. They would like to choose a leader.• The way they decide is that all 10 sit in a circle.• They start a count with person 1 and go in clockwise direction and skip 3. Person 4 reached is eliminated.• The count starts with the fifth and the next person to go is the fourth in count.• Eventually, a single person remains. c++ Implement above mentioned problem using circular linked list.Note: Implement only those functions which are necessary to solve this problem.
A task is given to generate matrix A from matrix B. 1 200 000 01 340 0 000 0 001 20 0 0 0 0 03 4 00 00 000 1 20 0 0 00340 0 000 0 0 1 2 B = 0 0 0 Lo 0 0 0 0 0 3 4 However, the program generates inaccurate matrix A where you need to debug. Analyze the program below to debug the syntax errors or violations of rules. Copy the Table Q4(b) and Paste it into your answer script. Replace with the corrected codes. Line No Program Codes 1 int n = 2; int B[n] = {{1, 2}, {3, 4}}; int P= 5; int A[2*P] [2*P] = {}; int col, row, j; for (int block = 0; block <= P; block++) ( (b) A = 13 2 3 4 5 6 7 8 9 coln (block+1) n; //col = 0, 2, 4, 6 row col; 10 11 for (int ii = 0; ii <= n; ii++) 12 ( 13 for (int jj = 0; jj <-(n-1); jj++) 14 { 15 16 } 17 18 Line No. Corrections A[row+ii] [col+jj] = B[ii+1] [jj+1]; Table Q4(b):
Answer the given question with a proper explanation and step-by-step solution. Part 1: Implement the quickselect median algorithm Implement the median algorithm from test 1, which is called the "quickselect" algorithm (due to it's relationship to quicksort). Note, it can be used to find the i-th smallest element for any value of i, but we'll just use it to find the median (i = length/2) The algorithm uses the partition helper method (provided) to find the median. The partition method moves small elements, to the left side, and big elements to the right side. Finding the median requires moving all elements smaller than the median to the left half, and all elements greater to the right half. We can call repeatedly partition in a binary-search-like manner to quickly put the median in the right place. Implement the driver method public static int median(int[] arr) which returns the median value, and modifies the input array so all small elements are in the left half, and all big elements…
Correct and detailed answer will be Upvoted else downvoted. Thank you!
The task is to get input (n) and make a list from 2 to n and remove its multiples from the list by applying recursive functions. Example: Input: 6 Output: [2, 3, 4, 5, 6] How to apply this python code in the task? def createList(n): #Base Case/s #TODO: Add conditions here for your base case/s #if <condition> : #return <value> #Recursive Case/s #TODO: Add conditions here for your recursive case/s #else: #return <operation and recursive call> #remove the line after this once you've completed all the TODO for this function return [] def removeMultiples(x, arr): #Base Case/s #TODO: Add conditions here for your base case/s #if <condition> : #return <value> #Recursive Case/s #TODO: Add conditions here for your recursive case/s #else: #return <operation and recursive call> #remove the line after this once you've completed all the TODO for this function return []
dont write code. just write algorithm or related theory of the following question. Narrative 2: We need to have a generic module which reads in file and gives the output in the format which would facilitate other programs to do comparison like the one we saw above to carry out analysis and comparison. Response Required: Write a program that reads a given text, outputs the text as is, and also prints the number of lines and the number of times each letter appears in the text. An uppercase letter and a lowercase letter are treated as being the same; that is, they are tallied together. Since there are 26 letters, we use an array of 26 components to perform the letter count. We also need a variable to store the line count. The text is stored in a file, which we will call textin.txt. The output will be stored in a file, which we will call textout.txt Input: A file containing the text to be processed. Output: A file containing the text, number of lines, and the number of times a letter…
python and algorithims.
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…
# write your implementation heredef maxProfitBrute(changes): """ it returns the indices of (i,j) indicating the day to buy and sell respectively to have the maximum profit in a list of prices per day in <changes>. Inputs: - changes: the list holding the changes in prices; the value whose index is k represents the change between day <k> and day <k+1> <changes> has at least a single change [two days] Output: - i: the index of the change before which we buy - j: the index of the change after which we sell - maxProfit: the value of the maximum profit Example: changes = [1,2] - that means the price started with <x>; - day 1: it became <x+1> - day 2: it became <x+3> In that case: (i,j) = (0,1) as we should buy at the first day, and sell after the third day """ # return the values return (0,0,0)
The following code is implementing a Treasure map use the A* algorithm to find the shortest path between two points in a map. It appears that the initial compare looks at the f_cost and decides that we are at the point in the map and exits the routine and prints only the starting point. I'm not sure how to fix it, any help would get appreciated. Example of the output from the following Python program: start place = (0, 0) Treasure location: (29, 86) Path to treasure:(0, 0) Python Code: import heapqimport random class Tile: def __init__(self, x, y): self.x = x self.y = y self.is_obstacle = False self.g_cost = 0 self.h_cost = 0 self.f_cost = 0 self.parent = None # Define comparison methods for Tile objects based on their f_cost def __lt__(self, other): return self.f_cost < other.f_cost def __eq__(self, other): return self.f_cost == other.f_cost class Map: def __init__(self, width, height):…
The Problem The Mastermind game board game is a code breaking game with two players. One player (your program) becomes the codemaker, the other the codebreaker. The codemaker (your program) creates a 4 digit secret code which is randomly generated by the supplied code below and the codebreaker tries to guess the 4 digit pattern. import randomsecretCode =[]for i in range (0,4): n = random.randint(1,9) secretCode.append(str(n)) print (secretCode) # take this out when you are playing the game for real because it is a secret The secret code pattern generated above will consist of any of the digits 1-9 and can contain multiples of the same digit. Your program should then tells the codebreaker which digits should be in their guess by displaying a sorted list of the digit characters contained in the secret code python list . Use the loopfor digit in sorted(secretCode): #display each digit on the same line for the player to see; there could be duplicate digits in the secret Prompt…