Stanimirovic I. Algorithms and Data Structures 2018

Textbook in PDF format

Asymptotic algorithm analysis is a methodology which has been given a lot of attention recently. Several methods of asymptotic analysis are considered to estimate the resource consumption of an algorithm, giving an assessment if a proposed algorithm can meet the resource constraints for a problem before the implementation. Processing nodes of the binary and non-binary trees in an organized manner is investigated using various algorithms. Several methods for implementing binary trees and their nodes are given. Issues relating to the design of algorithms and data structures for disk-based applications are solved, as well as problems of searching data stored in lists and tables. Algorithms for solving some problems related to finding shortest routes in a graph and the minimum-cost spanning tree, are applied to determine lowestcost connectivity in a network