Puedes seguirnos en



Algorithms in data structure


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:

  1. Input: Input data, supplied externally
  2. Output: Result of the program
  3. Finiteness: In every case, algorithm terminates after finite number of steps.
  4. Definiteness: The steps should be clear and unambiguous.
  5. 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.

Escrito por

Administrador de ENGGDRCAOS. Canal dedicado especialmente a la formación del estudiante que aspira a ser ingeniero. Todos los videos son Ingles. Apasionado del universo Apple, estudiante de Ingeniería y Gamer por vocación.




Singly linked list is a dynamically allocated list, which consists of one or more nodes. Each node contains a pointer which holds the address...


When virtual functions are created for implementing late binding, there are some basic rules that satisfy the compiler requirements: The virtual function must be...


Queue is a very useful data structure. Various features of operating system are implemented using queue. Scheduling of processes (Round Robin Algorithm) Spooling (to...


Maximum size of the queue is fixed at the time of compilation, when the queue is represented using an array, this causes wastage of...