![def p2(a): for i in rangeClen(a)): for j in a: print (ati].j) def p3(a): for i in a: for j in a: print (i,j) def p4(a): for i](http://img.homeworklib.com/questions/e4d52240-ff41-11eb-bf92-a74c6f6b2c64.png?x-oss-process=image/resize,w_560)
![print (ali-1]) p1 (a) i i*2 def p13(a) for i in range(len(a)*len(a)) print (a[o]) def p14 (a): i-1 while i<len(a): while j<le](http://img.homeworklib.com/questions/e56208f0-ff41-11eb-8278-fdb92bb1f243.png?x-oss-process=image/resize,w_560)
Homework Answers
`Hey,
Note: Brother in case of any queries, just comment in box I would be very happy to assist all your queries
a)
Since p1 has 2 loops but not nested both over length.So, it is O(n)
b)
Since p2 has 2 nested loops. So, it is O(n^2)
c)
Since p3 has 2 nested loops. So, it is O(n^2)
d)
Since p4 has 1 loop and calling p1 at every iteration of loop. So, it is O(n^2)
Note: Brother according to HomeworkLib's policy we are only allowed to answer first 4 parts if there are many. So, I request you to post other as separate posts.
Kindly revert for any queries
Thanks.
Add Answer to:
Python 3
5. (16 points) Determine the big-O running time of each of the following functions:...
C program Read file problem: For example, I have an input.txt file like this: q 1...
C program Read file problem: For example, I have an input.txt file like this: q 1 tq 4 p1 10 p2 5 p3 7 p4 20 p5 17 p6 9 p7 3 p8 11 p9 15 p10 1 I want the num of q is in one array, tq is in one array, the order of process(ie,p1,p2) is in one array, and process time is in one array(process time is the number after like p1,p2). There may many q,tq,p so...
1. Fill in the table below for the following compounds- molecules and polyatomic ions. For each...
1. Fill in the table below for the following compounds- molecules and polyatomic ions. For each compound, calculate the number of available electrons for all the atoms in the molecule and determine what the central atom in the molecule will be. Central Atom Total Number Molecular of Available Formula Electrons HCN P1 P2 SO3 P3 P4 NO3 P5 P6 P7 P8 SIH4 P9 P10 SO2CI2 NH4 P11 P12 P13 P14 PO43 P15 P16 PF5 SF&C P18 P17 P19 P20 XeF2
(C++) I need to write a priority queue(where the processes inside are listed as example: P25:2...
(C++) I need to write a priority queue(where the processes inside are listed as example: P25:2 , 25 being a randomly assigned ID(1-50) and 2 being a randomly assigned priority number(1-10). Once the priority queue is full(10 max), it will transfer the highest priority process to a waiting queue. Once the waiting queue is full(7 max), one process(highest priority) will transfer to a ready queue where the system would perform the process in a round robin style. Once 25 processes...
PYTHON: Im stuck here, big O notation and runtime. What is it and Why are they...
PYTHON: Im stuck here, big O notation and runtime. What
is it and Why are they those? Please look at the pic, need help as
Im confused. Thank You!
def method3(n): for i in range(n): for j in range(100): for k in range(n): print(i+j+k) What is the runtime (tightest/closest bound in terms of O) for the above python function (method 3)? Please briefly explain. Enter your answer here def method4(n): for i in range(n): for j in range(n, o, -2):...
without coding Give the Big O run-time of the following algorithms. Binary Search: def binary-search (arr,...
without coding
Give the Big O run-time of the following algorithms. Binary Search: def binary-search (arr, low, high, x): # Check base case if low > high : return None else: mid = (high + low) // 2 element arr[mid] == X: if element return mid elif element > X: return binary-search(arr, low, mid 1, x) else: return binary_search(arr, mid + 1, high, x) Selection Sort: def selection_sort (arr): for i in range (len(arr)): smallest index = i smallest value...
Python Merge Sort Adjust the following code so that you can create random lists of numbers of lengths 10, 15, and 20. You will run the merge sort 10 times for each length. Record the run time for the...
Python Merge Sort
Adjust the following code so that you can create
random lists of numbers of lengths 10, 15,
and 20.
You will run the merge sort 10 times for each
length. Record the run time for the length and then calculate the
average time to sort.
Finally, compare the average run time for each length to the
average time for the Merge Sort.
--------------------------------------------
Initial python code:
import random
import time
def mergeSort(alist):
print("Splitting ",alist)
if len(alist)>1:
mid...
What are the outputs for each question PYTHON Question 6 bools = [True, 0>-1, not not...
What are the outputs for each question PYTHON Question 6 bools = [True, 0>-1, not not True, 2%2 == 0, True and False] index = 0 while bools[index]: index += 1 print(index) a) 0 b) 1 c) 2 d) 3 e) none of the above Question 7 for i in range(2): for j in range(1): print(i, j, end = " ") a) no output b) 0 0 1 0 2 0 c) 0 0 0 1 1 0 1 1...
Q-1: Given the following code fragment, what is its Big-O running time? test = 0 for...
Q-1: Given the following code fragment, what is its Big-O running time? test = 0 for i in range(n): for j in range(n): test= test + i *j Q-2: Given3 the following code fragment what is its Big-O running time? for i in range(n): test=test+1 for j in range(n): test= test - 2 Q-3: Given the following code fragment what is its Big-O running time? i = n while i > 0: k=2+2 i...
I'm trying to sort a list of students from a text file in python(3.7) with three separate sorting functions (Bubble, selection, insert) I'm not sure to why as its not working I'm going to...
I'm trying to sort a list of students from a text file in python(3.7) with three separate sorting functions (Bubble, selection, insert) I'm not sure to why as its not working I'm going to guess its because I'm not using the swap function I built. Every time I run it though I get an error that says the following Traceback (most recent call last): File "C:/Users/tkoto/Desktop/SearchAndSortLab.py", line 146, in <module> main() File "C:/Users/tkoto/Desktop/SearchAndSortLab.py", line 122, in main studentArray.gpaSort() File "C:/Users/tkoto/Desktop/SearchAndSortLab.py",...
1. Determine the appropriate big-o expression for each of the following functions, and put your answer...
1. Determine the appropriate big-o expression for each of the following functions, and put your answer in the table we have provided in section 2-1 of ps5_parti. We've included the answer for the first function. (Note: We're using the “ symbol to represent exponentiation.) a (n) = 5n + 1 b. b(n) = 5 - 10n - n^2 o c(n) = 4n + 2log (n) d. e. d(n) = 6nlog (n) + n^2 e(n) = 2n^2 + 3n^3 - 7n...
1. Fill in the table below for the following compounds- molecules and polyatomic ions. For each compound, calculate the number of available electrons for all the atoms in the molecule and determine what the central atom in the molecule will be. Central Atom Total Number Molecular of Available Formula Electrons HCN P1 P2 SO3 P3 P4 NO3 P5 P6 P7 P8 SIH4 P9 P10 SO2CI2 NH4 P11 P12 P13 P14 PO43 P15 P16 PF5 SF&C P18 P17 P19 P20 XeF2
PYTHON: Im stuck here, big O notation and runtime. What
is it and Why are they those? Please look at the pic, need help as
Im confused. Thank You!
def method3(n): for i in range(n): for j in range(100): for k in range(n): print(i+j+k) What is the runtime (tightest/closest bound in terms of O) for the above python function (method 3)? Please briefly explain. Enter your answer here def method4(n): for i in range(n): for j in range(n, o, -2):...
without coding
Give the Big O run-time of the following algorithms. Binary Search: def binary-search (arr, low, high, x): # Check base case if low > high : return None else: mid = (high + low) // 2 element arr[mid] == X: if element return mid elif element > X: return binary-search(arr, low, mid 1, x) else: return binary_search(arr, mid + 1, high, x) Selection Sort: def selection_sort (arr): for i in range (len(arr)): smallest index = i smallest value...
Python Merge Sort
Adjust the following code so that you can create
random lists of numbers of lengths 10, 15,
and 20.
You will run the merge sort 10 times for each
length. Record the run time for the length and then calculate the
average time to sort.
Finally, compare the average run time for each length to the
average time for the Merge Sort.
--------------------------------------------
Initial python code:
import random
import time
def mergeSort(alist):
print("Splitting ",alist)
if len(alist)>1:
mid...
1. Determine the appropriate big-o expression for each of the following functions, and put your answer in the table we have provided in section 2-1 of ps5_parti. We've included the answer for the first function. (Note: We're using the “ symbol to represent exponentiation.) a (n) = 5n + 1 b. b(n) = 5 - 10n - n^2 o c(n) = 4n + 2log (n) d. e. d(n) = 6nlog (n) + n^2 e(n) = 2n^2 + 3n^3 - 7n...
Most questions answered within 3 hours.
-
Bus lines can be separated into two generic types, dedicated and
multiplexed.
i. What is the...
asked 23 minutes ago -
This is 'Branding' course which is part of marketing.
1. As a brand manager of Nudie...
asked 43 minutes ago -
You are considering the purchase of a new stock. The stock is
forecasted to pay a...
asked 1 hour ago -
vector a has componets Ax and Ay, and makes an angle theta with
the y-axis. Select...
asked 2 hours ago -
What were the problems of the american frontier after 1763 and how
did the British address...
asked 2 hours ago -
Why
isn’t pentanol (CH3 CH2 CH2 CH2 CH2 OH) very soluble in
water?
asked 3 hours ago -
In preparing its bank reconciliation for the month of April
2018, Haskins, Inc. has available the...
asked 4 hours ago -
Your job is to do the following: build a Monster class as your
base class, along...
asked 4 hours ago -
Phosgene (COCl2) reacts with ammonia
(NH3), as shown in this reaction. If 1.2 grams of
COCl2...
asked 4 hours ago -
Wefald Company sold bonds with a face value of $675,000 for
$625,000. The bonds have a...
asked 5 hours ago -
Research predefined java packages. Select 2 packages and
describe what they provide. Explain briefly what type...
asked 5 hours ago -
A fair 9-sided die is tossed. Find P(4
or at least 5). That is, find the...
asked 5 hours ago