Topics Covered:

- Sorting and Searching
- Data Structures
- Recursion

Click the button below to test the code for sorting, searching and data structures.

**(a) Pascal’s triangle is a number triangle with numbers arranged in staggered rows such that
a _{nr} = n!/ r!(n - r)! This equation is the equation for a binomial coefficient. You can build
Pascal’s triangle by adding the two numbers that are diagonally above a number in the triangle. Write a program
that prints out Pascal’s triangle in O(n^{2}). Provide an example for testing purposes.**

Example:

Enter the degree:

Print Pascal's Triangle**Sum of numbers n + (n - 2) + (n - 4) + ... (until n <= 0)**

Enter n:

print sum