# IN1002 Computation and Reasoning Notes

£10.00

IN1002 Computation and Reasoning Notes. These notes will mainly cover the first year of theory in Computation and Reasoning. This will go over many of the most important algorithms used for sorting and searching etc. There are many diagrams for visual learners along with numerous descriptions. There are 23 pages covering the following topics:

• Complexity Definition
• Asymptotic Definition
• Average and Worst-case complexity
• What Is the Knapsack Problem?
• Correctness
• Complexity Classes
• Sort Algorithm Definitions
• Selection Sort (Algorithm)
• Insertion Sort (Algorithm)
• Binary Search (Algorithm)
• Complexity classes Revised
• Recursive Algorithms
• Power (Algorithm)
• Iterative Power (Algorithm)
• Fast Power (Algorithm)
• Divide-and-Conquer Sorting Algorithms
• Quick Sort (Algorithm)
• Merge Sort (Algorithm)
• Downsides to Algorithms
• Important things to Remember

• Instant Email Access Link Delivery
• Unlimited Access | Read Only
• Manually Checked for Accuracy
• Module and Course Specific
SKU: 09432938_CITY

### Description

IN1002 Computation and Reasoning Notes. These notes will mainly cover the first year of theory in Computation and Reasoning. This will go over many of the most important algorithms used for sorting and searching etc. There are many diagrams for visual learners along with numerous descriptions. There are 23 pages covering the following topics:

• Complexity Definition
• Asymptotic Definition
• Average and Worst-case complexity
• What Is the Knapsack Problem?
• Correctness
• Complexity Classes
• Sort Algorithm Definitions
• Selection Sort (Algorithm)
• Insertion Sort (Algorithm)
• Binary Search (Algorithm)
• Complexity classes Revised
• Recursive Algorithms
• Power (Algorithm)
• Iterative Power (Algorithm)
• Fast Power (Algorithm)
• Divide-and-Conquer Sorting Algorithms
• Quick Sort (Algorithm)
• Merge Sort (Algorithm)
• Downsides to Algorithms
• Important things to Remember