This resource was reviewed using the Curriki Review rubric and received an overall Curriki Review System rating of 3.00, as of 2009-07-31.
Technical Completeness: 3
Content Accuracy: 2
Appropriate Pedagogy: 0
This resource is a study guide or notes for a basic programming principle: divide and conquer. This resource would be for advanced placement or college level course in computer information systems or computer science programming. The resource is easy to locate in the file. The content is for advanced students in computer science. There is no pedagogy for this resource. One main strength is the use of graphical organizers to highlight main ideas and "breakdown" difficult terminology and connections.
Information - Algorithms - Lesson 2 - Divide and Conquer Method
This lesson is about the divide and conquer method of problem solving. It includes examples to help you understand the topic. A problem set with solutions is provided for further practice.
Career & Technical Education > General Mathematics > General Science > General
While computing the execution time and the time/space complexity for any problem, we come across situations in which the mathematical expression cannot be solved without the usage of recurrence. That's why this topic is discussed here.