This means that one cycle after a multiplication has

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: s up to and including the one on this row. The third shows the time spent on this particular function, and the fourth shows how many times it was called (not counting recursive calls). In our example, the function sort_words was called only once, but this single call required 7.80 seconds, while the function lower1 was called 946,596 times, requiring a total of 0.41 seconds. The second part of the profile report shows the calling history of the function. The following is the history for a recursive function find_ele_rec: 4872758 find_ele_rec [5] 946596/946596 insert_string [4] 946596+4872758 find_ele_rec [5] 26946/26946 save_string [9] 26946/26946 new_ele [11] 4872758 find_ele_rec [5] [5] 6.7 0.60 0.60 0.00 0.00 0.01 0.01 0.01 0.00 This history shows both the functions that called find_ele_rec, as well as the functions that it called. In the upper part, we find that the function was actually called 5,819,354 times (shown as “946596+4872758”)— 4,872,758 times by itself, and 946,596 times by function...
View Full Document

This note was uploaded on 09/02/2010 for the course ELECTRICAL 360 taught by Professor Schultz during the Spring '10 term at BYU.

Ask a homework question - tutors are online