Giovanni Bernardes’s Reviews > Introduction to Algorithms > Status Update
Giovanni Bernardes
is on page 38 of 1184
Chapter 2.3 about Designing Algorithms initiated.
2.3.1 The divide-and-conquer method
Explain the divide and conquer approach through an example of merge
— 22 hours, 52 min ago
2.3.1 The divide-and-conquer method
Explain the divide and conquer approach through an example of merge
Like flag
Giovanni’s Previous Updates
Giovanni Bernardes
is on page 43 of 1184
End of the chapter 2
We finish analyzing the running time of a divide and conquer algorithm
— 19 hours, 12 min ago
We finish analyzing the running time of a divide and conquer algorithm
Giovanni Bernardes
is on page 33 of 1184
Chapter 2.2
The chapter talks about how we must consider the technology where the instructions of the program gonna run into to be able to analyze the algorithm.
Then we start to analyze the algorithm (insertion sort) of the last chapter.
To do so we must examine how many times it executes each line of pseudocode and how long each line of pseudocode takes to run. Therefore, the 2 measures we take in count to analyze
— Mar 11, 2026 01:33PM
The chapter talks about how we must consider the technology where the instructions of the program gonna run into to be able to analyze the algorithm.
Then we start to analyze the algorithm (insertion sort) of the last chapter.
To do so we must examine how many times it executes each line of pseudocode and how long each line of pseudocode takes to run. Therefore, the 2 measures we take in count to analyze
