easleyschool

{
    int z = a + b + c;
    return(z);
}

easleyschool

/*  Below program is written in C language  */
# include <stdio.h>

void heapify(int arr[], int n, int i)
{
    int largest = i;
    int l = 2*i + 1;
    int r = 2*i + 2;

    // if left child is larger than root

easleyschool

/*  
    a[] is the array, p is starting index, that is 0,
    and r is the last index of array.
*/
#include <stdio.h>

// Lets take a[5] = {32, 45, 67, 2, 7} as the array to be sorted.

// merge sort function
void mergeSort(int a[], int p, int r)

easleyschool

// simple C program for Quick Sort
# include <stdio.h>

// to swap two numbers
void swap(int* a, int* b)
{
    int t = *a;
    *a = *b;
    *b = t;
}

easleyschool

// C program implementing Selection Sort
# include <stdio.h>

// function to swap elements at the given index values
void swap(int arr[], int firstIndex, int secondIndex) 
{   
    int temp;
    temp = arr[firstIndex];
    arr[firstIndex] = arr[secondIndex];
    arr[secondIndex] = temp;

easleyschool

/*
    function for carrying out binary search on given array
    - values[] => given sorted array
    - len => length of the array
    - target => value to be searched
*/
int binarySearch(int values[], int len, int target)
{
    int max = (len - 1);
    int min = 0;

easleyschool

class node
{
	int data;
	node *next;
};

class Stack
{
	private:
		node *front;  // points to the head of list

easleyschool

int Stack::top()
{
	return front -> data;
}

easleyschool

void Stack :: pop()
{
	// if empty
	if(front == NULL)
  {
		printf( "UNDERFLOW\n" );
  }
	// delete the first element
	else
	{

easleyschool

void Stack::push(int d)
{
	// creating a new node
	node *temp;
	temp = new node();
  
	// setting data to it
	temp->data = d;
  
	// add the node in front of list