CSC/ECE 517 Fall 2013/ch1 1w02 pp: Difference between revisions
Jump to navigation
Jump to search
| Line 1: | Line 1: | ||
==Introduction to | ==Introduction to Profiling== | ||
[http://en.wikipedia.org/wiki/Profiling_(computer_programming) Profiling] in general, is an important feature in computer science. It is technique, in the most basic terms, by which one can analyze the efficiency of the program or code by measuring the complexity of a program time or space complexity, and some other related performance parameters. For Example, the time complexity includes total running time, CPU time, memory used, time taken by each module or function, function calls, response time and many similar important aspects of our program/application. | [http://en.wikipedia.org/wiki/Profiling_(computer_programming) Profiling] in general, is an important feature in computer science. It is technique, in the most basic terms, by which one can analyze the efficiency of the program or code by measuring the complexity of a program time or space complexity, and some other related performance parameters. For Example, the time complexity includes total running time, CPU time, memory used, time taken by each module or function, function calls, response time and many similar important aspects of our program/application. | ||
Revision as of 22:18, 16 September 2013
Introduction to Profiling
Profiling in general, is an important feature in computer science. It is technique, in the most basic terms, by which one can analyze the efficiency of the program or code by measuring the complexity of a program time or space complexity, and some other related performance parameters. For Example, the time complexity includes total running time, CPU time, memory used, time taken by each module or function, function calls, response time and many similar important aspects of our program/application.