Consider the following algorithms. Each algorithm operates on a list containing n elements, where nis a very large integer. I. An algorithm that accesses each element in the list twice II. An algorithm that accesses each element in the list n times II. An algorithm that accesses only the first 10 elements in the list, regardless of the size of the list Which of the algorithms run in reasonable time? I nly B IIl only c I and Il only I, I, and II D.

Consider the following algorithms. Each algorithm operates on a list containing n elements, where nis a very large integer. I. An algorithm that accesses each element in the list twice II. An algorithm that accesses each element in the list n times II. An algorithm that accesses only the first 10 elements in the list, regardless of the size of the list Which of the algorithms run in reasonable time? I nly B IIl only c I and Il only I, I, and II D.

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

Write a Java program that generates randomly a list of N integers, sorts the generated list using each of the three sorting algorithms: mergesort sort, quicksort that use the first element as a pivot, and quicksort that use the middle element as pivot and prints as output the execution time for each of the algorithms for randomly generate lists of size N = 40000, 100000 and 200000 and sorted lists as shown in the table.
Q20. Suppose a computer program has been initialized such that the following sets have been stored for use in any algorithm: A = {1, 2, 3, ..., 40} B = {-7, -6, -5, ..., 30} Consider the following algorithm, which represents one part of the whole computer program (comments may occur after the # symbol on any line and are not used in computations): #Part 1: computes A - B and its cardinality AminusB = set() for element in A: # this line runs through every element in A if not(element in B): #A - B is the set of elements that are in A and are not in B AminusB.add(element) # Add to AminusB every element in A if the element is also not in B n = len(AminusB) #len() returns the number of elements in the array print(n) What value is printed as a result of executing this algorithm?
Please show and explain so I can nderstand.
Question Aac Full explain this question very fast solution sent me step by step
ORIGINAL Q: Instead of reading in an entire list N1,N2,⋯N1,N2,⋯ all at once, some algorithms (depending on the task to be done) can read in only one element at a time and process that single element completely before inputting the next one. This can be a useful technique when the list is very big (e.g., billions of elements) and there might not be enough memory in the computer to store it in its entirety. Write an algorithm that reads in a sequence of values v≥0, one at a time, and computes the average of all the numbers. You should stop the computation when you input a value of V = −1. Do not include this negative value in your computations; it is not a piece of data but only a marker to identify the end of the list. PLEASE MODIFY THE FOLLOWING CODE SO THE USER INPUTS THE NUMBERS ONE BY ONE: ORIGINAL Q: Instead of reading in an entire list N1,N2,⋯N1 ,N2,⋯ all at once, some algorithms (depending on the task to be done) can read in only one element at a time and process that single…
kindly solve this problem using python
I need to write an algorithm pseudocode that sorts a list of n elements in non-increasing order by finding the largest and smallest elements and exchanging those elements with the elements in the first and last positions. Then the size of the list is reduced by 2, excluding the two elements that are already in the proper positions, and the process is repeated on the remaining part of the list until the entire list is sorted. I also need to analyze the algorithm and show the results using order notation. I was trying to use arguments but I got stuck.
Consider the following three sorting algorithms: Insertion Sort, Heapsort, and Quicksort. Here are three statements. A. Iam an incredibly fast sorting algorithm that runs in O(n log n) time on average, though my worst case run time is O(n2). B. I run very quickly for small values of n, but unfortunately am really slow when n is large. My average run time is O(n2). C. I am an in-place sorting algorithm whose average case and worst case running time is O(n log n). For each statement (A, B, C), determine the correct sorting algorithm.