Channi Studies

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..

Data StructureA data structure is a way of organizing, storing, and performing operations on data.Some of the operations that can be performed on a data structure include accessing or updating data, searching for specific data, inserting new data, and removing data. In our post, we will take on data structures while focusing on the array and linked list. These basic data structures form many abs..

A data structure is a way of organizing, storing, and performing operations on data. Array, Linked list, Hash table are some examples of basic data structures.  The selection of data structures used in a program depends on both the type of data being stored and the operations the program may need to perform on that data. Appending a data into an array and linked list both requires 0 data shift. ..