[′frē·kwən·sē ə‚nal·ə·səs] (computer science) A determination of the number of times certain parts of an algorithm are executed, indicating which parts of the algorithm consume large quantities of time and hence where efforts should be directed toward improving the algorithm.