shemul

#include <iostream>

using namespace std;
struct Node {
    int data ;
    struct Node *next ;
};

struct Node *head = NULL, *curr = NULL ;

shemul

#include <iostream>

using namespace std;

void max_heapfy(int *p , int i , int n)
{
    int lc = 2*i + 1 ;
    int rc = 2*i + 2 ;
    int li;
    if(lc < n && p[lc] > p[i])

shemul

// Merge Sort.cpp : Defines the entry point for the console application.
//k

#include <iostream>
#include <stdlib.h>

using namespace std;

void Merge( int *A,int *L,int *R,int lCount,int rCount )
{

shemul

// File.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"

#define MAX_SIZE 100000

using namespace std;

struct Entry 

shemul

//shell sort

#include <iostream>

using namespace std;

int iCount (int *A,int size)
{
    int counter = 0 ;

shemul

#include <iostream>

using namespace std;

struct BSTnode
{
    int data;
    BSTnode* left;
    BSTnode* right;
};

shemul

package com.example.here;

import android.support.v7.app.ActionBarActivity;
import android.support.v7.app.ActionBar;
import android.support.v4.app.Fragment;
import android.app.AlertDialog;
import android.app.Notification;
import android.app.NotificationManager;
import android.content.DialogInterface;
import android.os.Bundle;

shemul

.model small

.stack 100h

.data 
     
       MSG1 DB 'A FOR ADDITION S FOR SUB...   : $'
       MSG2 DB 'INPUT FOR ADDITION$'
       INPUT_1 DB 'FIRST NUMBER : $'   
       INPUT_2 DB 'SECOND NUMBER : $'

shemul

.MODEL SMALL

.STACK 100H

.DATA 
   input_line db ?
   MSG1 DB 'Enter Char : $'  
   str1 db ' is a vowel$'
   str2 db ' is a consonant$'
    str3 db ' is a number$'

shemul

.MODEL SMALL
 .STACK 100H

 .DATA
   PROMPT_1  DB  'Enter the character : $'
   PROMPT_2  DB  0DH,0AH,'The ASCII code of the given number in binary form is : $'
   PROMPT_3  DB  0DH,0AH,'The number of 1 bits in ASCII code are : $'

 .CODE
   MAIN PROC