Book Details

A Modular Calculus for the Average Cost of Data Structuring

Publication year: 2008

ISBN: 978-0-387-73384-5

Internet Resource: Please Login to download book

This volume, with forewords by Greg Bollella and Dana Scott, presents novel programs based on the new advances in this area, including the first randomness-preserving version of Heapsort. Programs are provided, along with derivations of their average-case time, to illustrate the radically different approach to average-case timing. The automated static timing tool applies the Modular Calculus to extract the average-case running time of programs directly from their MOQA code.

Subject: Computer Science, algorithm, algorithms, complexity, computer science, data structures, programming, programming language, random structures, real-time, real-time languages, semantics, series-parallel data structures, software timing, power analysis, sorting and search algorithms, static analysis, algorithm analysis and problem complexity