Channi Studies

Big O notation is a mathematical way of describing how a function (running time of an algorithm) generally behaves in relation to the input size. Given a function that describes the running time of an algorithm, the Big O notation for that function can be determined using the following rules:If f(N) is a sum of several terms, the highest order term (the one with the fastest growth rate) is kept ..

Upper and lower bounds An algorithm with runtime complexity: T(N) has a lower bound and an upper bound.Lower bound: A function f(N) that is ≤ the best case T(N), for all values of N ≥ 1.Upper bound: A function f(N) that is ≥ the worst case T(N), for all values of N ≥ 1.tip: when considering lower/upper bounds, just consider N = 1 Let's take a look on to an example. Say that the worst case of tim..

In practice, designing an efficient algorithm aims to lower the amount of time that an algorithm runs. However, a single algorithm can always execute more quickly on a faster processor. Therefore, the theoretical analysis of an algorithm describes runtime in terms of number of constant time operations, not nanoseconds. A constant time operation is an operation that, for a given processor, always..

Searching is a fundamental concept in computer science where the goal is to find the position of a specific item within a dataset.In this post, we will take a look on a some basic linear search and binary search with the implementation on Python code.  Why do we have to study about searching algorithms? Searching: Key Concept in Computer Science- Locate specific item in data- Fundamental to data..