An Introduction to Algorithms and the Big O Notation

  • Chivers I
  • Sleightholme J
N/ACitations
Citations of this article
28Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In response to feedback from course delegates this third edition has been revised throughout. It expands on the second edition with new and updated examples in the chapters on arithmetic, i/o, character data, modules, data structuring and generic programming with minor updates to the rest of the chapters. Key Features · lots of clear, simple examples highlighting the core language features of modern Fortran including data typing, array processing, control structures, functions, subroutines, modules, user defined types, pointers, operator overloading, generic programming, object oriented programming and parallel programming · pinpoints common problems that occur when programming · illustrates the use of several compilers · with better standards conformance in compilers there are new examples illustrating the following major features: - C Interop - IEEE arithmetic - parameterised derived types Introduction to Programming with Fortran will appeal to the complete beginner, existing Fortran programmers wishing to update their code and those with programming experience in other languages.

Cite

CITATION STYLE

APA

Chivers, I., & Sleightholme, J. (2015). An Introduction to Algorithms and the Big O Notation. In Introduction to Programming with Fortran (pp. 359–364). Springer International Publishing. https://doi.org/10.1007/978-3-319-17701-4_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free