editing algorithm measurements ( O(n) is faster than O(nlogn) )

After writing cpp code to check if the comparison section in page 45 is correct. The Output that reveals that algorithm 2 is the fastest and algorithm 1 and 3 are nearly equal. The code link :https://github.com/eng-abdelrahman-sharaf/shared_repo/blob/main/cphb-page-45.cpp The output link : https://github.com/eng-abdelrahman-sharaf/shared_repo/blob/main/output_cphb_page_45.txt