Algorithms in data structure Krish Advani 18/02/2013 Engineering 1 Comentario The field of Computer Science revolves around writing of programs for several problems for various domains. A program consists of data structures and algorithms. An algorithms is a set of steps required to solve a problem. These steps are performed on a sample data representing an instance of the problem. Thus an algorithm maps a set of input data to a set of output data through a sequence of operations. An algorithm must have the following properties: Input: Input data, supplied externally Output: Result of the program Finiteness: In every case, algorithm terminates after finite number of steps. Definiteness: The steps should be clear and unambiguous. Effectiveness: An Algorithm should be written using basic instructions. It should be feasible to convert the algorithm in a computer program. The algorithm is basically a set of steps written to reduce the complexity of the actual program. Writing an algorithm is essential for any program in absolutely any programming language.