let’s first review some of the important maths that we’ll need in the series.
Starting with the laws of exponents:

Logarithm definition and its laws: :


Logarithm notations that we will be frequently using:

Arithmetic Series:

let’s first review some of the important maths that we’ll need in the series.
Starting with the laws of exponents:
Logarithm definition and its laws: :
Logarithm notations that we will be frequently using:
Arithmetic Series:
#include<stdio.h> #include<stdlib.h> int MAX=0;//Max elements in the queue typedef struct mynode { char info; int pri; struct mynode...
#include<stdio.h> int MAX=0; int front=0; int rear=-1; int queue[100]; //Empty int isEmpty() { if(front==0 && rear==-1) return 1;...
Comments