• Mir omranudin abhar
• Nisha Gatuam

in this review paper, we will discuss about data structure & its algorithms and their complexity. First we begin with the introduction of data structure and the algorithm and then we discuss the relationship between them. Then we will discuss about complexities of the algorithm in data structure. A data structure is a specialized format for organizing and storing data. An algorithm is a step by step method of solving a problem. It is commonly used for data processing, calculation and other related computer and mathematical operations. To write any program we have to select proper algorithm and the data structure. If we choose improper data structure, algorithm cannot work effectively. Similarly, if we choose improper algorithm we cannot utilize the data structure effectively. Thus there is a strong relationship between data structure and algorithm. The complexity of an algorithm is a measure of the time and/or space required by an algorithm for an input of a given size (n).

Algorithm, Complexity, Asymptotic Notation , Analysis

"A Review Data structure , Algorithms & Analysis", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 6, page no.59-64, June-2019, Available :http://www.jetir.org/papers/JETIR1906791.pdf

"A Review Data structure , Algorithms & Analysis", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 6, page no. pp59-64, June-2019, Available at : http://www.jetir.org/papers/JETIR1906791.pdf