Question

If 0° 1 . Answer with step-by-step explanation

Answer 1

Answer:

if 0 !=1, 1!=1, can we say 0=1? I like to look at the output of functions as “properties” inherent to the numbers. Each number put to different functions .

Answer 2

Step-by-step explanation:

Does it mean the time required for any operation is constant and doesn't depend on the number of data items stored?

Data Structures

Algorithms

Pattern Recognition

Data Analysis

Biometrics

Share

Most recent answer

28th Oct, 2019

Khairuddin Siddiqui

Mohammad Ali Jinnah University

For any monotonic functions f(n) and g(n) from the positive integers to the positive integers, we say that f(n) = O(g(n)) when there exist constants c > 0 and n0 > 0 such that:

f(n) ≤ c * g(n), for all n ≥ n0

Intuitively, this means that function f(n) does not grow faster than g(n), or that function g(n) is an upper bound for f(n), for all sufficiently large n→∞. Here is a graphic representation of f(n) = O(g(n)) relation:-

Constant Time: O(1)

An algorithm is said to run in constant time if it requires the same amount of time regardless of the input size. Examples:

array: accessing any element

fixed-size stack: push and pop methods

fixed-size queue: enqueue and dequeue methods.