Time-space analysis in Programming Languages
Published: 2013
Author(s) Name: Jatinder Manhas |
Author(s) Affiliation: Department of Computer Science and IT (BC), University of Jammu, (J&K), India.
Locked
Subscribed
Available for All
Abstract
Time and space complexity of a program always remain an
issue of greater consideration for programmers. The author
in this paper has discussed the time and space complexity
of a single program written in different languages. The
sample program was one by one executed on a single
machine with similar configuration in each case with
different compiler versions. It has been observed that in
different languages (C, C++, Java, C#) time taken varies.
Mostly the research done for language in case of time-space
trade-off is usually not bounded with fixed system
configuration. In that case we calculate the time and space
complexity of a particular algorithm with no system
constraints. Such procedure does not give us time and
space complexity of program with respect to language. The
author here believes to calculate the time and space
complexity of a program with respect to language.
While execution of a sample code written in different
languages on fixed system configuration, for each run of
sample code, CPU time is calculated and compared. It
shows how the choices of language affect the time and
space resource.
Keywords: Time and space Complexity, Program, Language, Time Complexity, Space Complexity
View PDF