# Tag - triangular numbers

## C Programming – check for pair in A[] with sum as x

Time Complexity: Depends on what sorting algorithm we use. If we use Merge Sort or Heap Sort then (-)(nlogn) in worst case.

## C++ Programming – Construct an array from its pair-sum array

C++ Programming - Construct an array from its pair-sum array - Algorithm - A pair-sum array for an array is array that contains sum of all pairs in ordered

## Java Programming – Construct an array from its pair-sum array

Java Programming - Construct array from its pair-sum array - Algorithm - A pair-sum array for array is array that contains sum of all pairs in ordered form.

## C++ Programming – Count Distinct Non-Negative Integer Pairs (x, y)

C++ Programming - Count Distinct Non-Negative Integer Pairs (x, y) - Mathematical Algorithms - A Simple Solution is to run two loops. The outer loop

## C Programming – Pascal’s Triangle

C Programming - Pascal’s Triangle - Mathematical Algorithms - Pascal’s triangle is a triangular array of the binomial coefficients that takes an integer.