dsa

Consider an inventory of 1 million(106) items of a store. If the application is to search an item, it has to search an item in 1 million(106) items every time slowing down the search. As data grows, search will become slower.

Processor speed although being very high, falls limited if the data grows to billion records.

As thousands of users can search data simultaneously on a web server, even the fast server fails while searching the data.

two of the most important aspects of computer science.

is a representation of data and the operations allowed on that data.

are the method of representing of logical relationships ,between individual data elements related to the solution of a given problem.

A high level, language independent description of a step-by-step process for solving a problem

Its the amount of memory space required by the algorithm, during the course of its execution. Space complexity must be taken seriously for multi-user systems and in situations where limited memory is available.

is a way to represent the amount of time required by the program to run till its completion. It's generally a good practice to try to keep the time required minimum, so that our algorithm completes it's execution in the minimum time possible.

criteria of algorithm

A graphic map of the path of control or data through the operations in a program or an information handling system.

types of flowchart

Are indicated by straight lines w/ optional arrows to show the direction of the dataflow.

statements that result a Boolean value.

is the textual representation of an Algorithm’s Flowchart.