Prakash Kumar

The complexity of an algorithm shows how fast or slow that particular algorithm can solve the desired problem. We calculate complexity of algorithm in these three scenarios 1). Worst Case It denotes the maximum run time that could be taken by an algorithm over all inputs of size n. That is, we only consider the … Read more

The efficiency of an algorithm defines the number of computational resources used by an algorithm and time taken by an algorithm to produce the desired result. If an algorithm contains only linear functions (having no loops or recursions), we calculate its efficiency or running time by counting the number of instructions it contains. However, For … Read more

What is Algorithm? Key Features of an Algorithm An algorithm must satisfy the following criteria 1. Input: An algorithm should have zero or more but should be a finite number of inputs. We can also say that it is essential for any algorithm before starting. Input should be given to it initially before the Algorithm begins. … Read more

Data Type For example, int, char, float, etc. are the data types. Example: In the above example, we have declared a variable name “data”. Its data type is int, means that we can assign only integer value  to this variable “data” not character value.  Classification of C data types Type Data Types Basic data types … Read more

There are two types of data structure: Primitive data Structure Non-Primitive data Structure Primitive data structure Primitive data structures are the fundamental data structures. It can be operated directly on the data and machine instructions. It is also know as basic data structure. Primitive data structures are defined by the programming languages, or we can … Read more