Sort the following functions in increasing order of growth following the Big-O notation (NB: There is no need typing the functions, just use the labels (a) to (h) to sort the functions accordingly.) a. log log log(n) b. n3 log(n) c. 4.5(n) d. 3(n) e. n(4) log(n) f. log log(n) g. 4.5n + log(n) h. 3(500)

Sort the following functions in increasing order of growth following the Big-O notation (NB: There is no need typing the functions, just use the labels (a) to (h) to sort the functions accordingly.) a. log log log(n) b. n3 log(n) c. 4.5(n) d. 3(n) e. n(4) log(n) f. log log(n) g. 4.5n + log(n) h. 3(500)

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 11PE

See similar textbooks

Similar questions

Problem: Given 20 positive integers as input, calculate the number of divisors for each integer and sort the data set from smallest to largest based on the number of divisors. When multiple integers have the same number of divisors then sort them smallest to largest. Examples: Integer value 12 has divisors 1, 2, 3, 4, 6, 12 for a total of 6. Prime numbers only have divisors of 1 and the number itself. The integer 1, the smallest value that will be provided as input, has only a single divisor, itself. Example Execution #1: Enter 20 integer values -> 21 15 10 6 3 1 28 13 5 7 9 29 31 37 17 19 12 43 24 2 Data sorted by number of divisors: 1 2 3 5 7 13 17 19 29 31 37 43 9 6 10 15 21 12 28 24 Example Execution #2 (data does not have to be unique): Enter 20 integer values -> 9 7 5 3 8 6 4 2 9 75 3 8 6 4 2 9 7 5 3 Data sorted by number of divisors: 2 2 3 33 5 5 5 7 7 7 4 4 9 9 9 6 6 8 8
. USE PYTHON Write a function that generate ‘n’ random numbers and compare sorting time for Bubble Sort, Insertion Sort and Selection algorithms Void SortComparision(int n) The output for n = 100 should be look like: Time comparison for 100 numbers: Bubble Sort: x seconds Insertion Sort: y seconds Selection Sort: z seconds
Problem2: A square matrix can be represented by a two-dimensionalarray with N rows and N columns. You may assume a maximum size of 50 rows and 50 columns. 1. Write an algorithm MakeEmpty(n), which sets the first n rows and n columns to zero. 2. Write an algorithm Add(M1, M2, M3), which adds two matrices M1 and M2 together to produce matrix M3. 3. Write an algorithm Subtract(M1, M2, M3), which subtracts matrix M2 from matrix M1 to produce matrix M3. 4. Write an algorithm Copy(M1, M2), which copies matrix M1 into matrix M2.
Python question Application: Big-O Notation (Q8-11) For each of the time complexities in this segment give the tightest bound in terms of a simple polylogarithmic function using big-O notation. Note: use the ‘^’ symbol to indicate exponents, i.e., write O(n^2) for O(n2). Question 8 (Big-O Notation 1) T(n) = n2+ log n + n Question 9 (Big-O Notation 2) T(n) = n/3 + 4 log n + 2n log(n) Question 10 (Big-O Notation 3) T(n) = 7n5 + 2n Question 11 (Big-O Notation 4) T(n) = (n%5) + 12,000
Code in Python Question 1: Write a Python program in which you will invert the logic of Bubble-Sort (means compare last two elements and sort in left to right direction).Question 2: Write a Python program in which you will invert the logic of Selection-Sort (means select Max-value in each iteration and sort in right to left direction)
Python Numpy function to complete: def t19(N, s, X, y): Inputs: N: An integer s: A floating-point number - x: A floating-point number - y: A floating-point number Returns: A numpy array I of shape (N, N) such that I[i, j] exp(-||(j, i) –- (x, y)||^2 / s^2) Par: 3 lines Instructor: 2 lines return None
Using C Program and arrays, Write a program that will give the sum of the main and opposite diagonal elements of a square matrix. If the matrix is not a square, print "Matrix is not a square" Example: Input (The first line contains the number of rows and the second line contains the number of columns. The succeeding lines contains the values of the matrix) 3 3 12 23 34 45 46 47 56 51 23 Output 217
Python Coding Exercise: Write a function that takes three parameters: a 2-D array arr, a row location i, a column location j and returns a float representing the fraction of neighbors around arr [i,j] # write your function here:def find_frac(arr,i,j):
Using “Def” keyword write a function that returns the sum of each element for the given array (The function name will be SumofArrayElements) Not: Write some print functions to see the outputs inside each function. (Python programming language)
Code in Python: Question 2: Write a Python program in which you will invert the logic of Selection-Sort (means select Max-value in each iteration and sort in right to left direction)
Using “Def” keyword write a function that returns the min element of the given array elements (The function name will be MinofArrayElements) Not: Write some print functions to see the outputs inside each function. (Python programming language)
Please C-progra Given: Two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array and return the sorted array as a new array. The number of elements initialized in nums1 and nums2 are m and n respectively. Example 1: Input: nums1 = [1,2,3,0,0,0], m = 3, nums2 = [2,5,6], n = 3 Output: [1,2,2,3,5,6]