mbalayil

/**
  * Divide  : Divide the n-element array into two n/2-element
  *           sub-arrays
  * Conquer : Sort the two sub-arrays recursively using
  *           merge sort
  * Combine : Merge the two sorted subsequences to form the
  *           sorted array
  **/

#include<stdio.h>

mbalayil

/** Divide  : Partition the array A[low....high] into two sub-arrays
  *           A[low....j-1] and A[j+1...high] such that each element
  *           of A[low....j-1] is less than or equal to A[j], which
  *           in turn is is less than or equal to A[j+1...high]. Compute
  *           the index j as part of this partitioning procedure.
  * Conquer : Sort the two sub-arrays A[low....j-1] and A[j+1....high]
  *           by recursive calls to quicksort
  **/

#include<stdio.h>

mbalayil

/**
  * Swapping without using a temporary variable in C
  * (Addition & Subtraction)
  **/

#include<stdio.h>

int main(void)
{
  int a = 5, b = 10;

mbalayil

/** Binary Search locates the position of an item in a sorted list.
  *
  * Divide : It works by dividing the list into two halves and
  *          comparing the input value to be searched with the
  *          middle element of the list.
  *
  * Conquer : If the input value is equal to the mid value, search
  *           is successful. If greater, call binary search only
  *           on the greater sub-array of the sorted list and if
  *           lesser, call binary search on the lesser sub-array.

mbalayil

/**
  * Swapping without using a temporary variable in C
  * (Multiplication & Division)
  **/

#include<stdio.h>

int main(void)
{
  int a = 5, b = 10;

mbalayil

/**
  * Swapping without using a temporary variable in C 
  * (XOR)
  **/

#include<stdio.h>

int main(void)
{
  int a = 5; /* a = 0101 */

mbalayil

/**
  * To check whether a number is prime or not
  **/

#include<stdio.h>
#include<stdlib.h>

int main(void)
{
  int n, i, p = 1;

mbalayil

/**
  * To find the factorial of a number
  **/

#include<stdio.h>
#include<stdlib.h>

int main(void)
{
  int n, i, f;

mbalayil

/**
  * A palindrome is a word, phrase, number or other sequence
  * of units that can be read the same way in either direction
  **/

#include<stdio.h>
#include<stdlib.h>
#include<string.h>

int main(void)

mbalayil

/**
  * Program to check the occurrences of a pattern in a text/string
  * This program checks whether the pattern occur in the string
  * or not, if yes at what positions and also print the text/string
  * highlighting the occurrences 
  **/

#include <stdio.h>
#include<string.h>