Programming Club, NIT Raipur

An Introduction to Graph

Here we are not gonna discuss the definitions of graph and its algorithm we are just going to visualise what graph…

STL — Standard Template Library

Here we are going to discuss about some STLs that are frequently used in competitive programming. Like string, vector, pair, queue, stack, set and map.

What is STL ?

Complexity — It is not that complex

Complexity : Complexity of an algorithm is a measure of the amount of time and/or space required by an algorithm for an input of a given size (n).

In analysing an algorithm, rather than a piece of code, we will try and predict the number of…

Prime Numbers — Mysterious and Beguiling

All prime numbers except 2 are odd, this makes 2 the oddest prime.

There are 78498 prime numbers smaller than equal to 10⁶

This article is divided in two parts

1. Identifying whether a…

What is competitive programming, and Why should you care.

Competitive programming is one branch of a larger tree. This tree broadly depicts various fields that a student must know about.

Heaps & Priority Queues

The heart of Graph Algorithms.

Prerequisites: