IMS Manthan (The Journal of Mgt., Comp. Science & Journalism)

1. Jatinder Manhas – Department Of Computer Science And It (bc), University Of Jammu, (j&k), India.

Received
08-Sep-2013
Accepted
-
Published
08-Sep-2013
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.
Locked
Subscribed
Open Access