Venkat.R ramsunvtech

## nodejs-vhost.js
var connect = require('connect'),
	serveStatic = require('serve-static'),
	vhost = require('vhost')

var mailapp = connect()

// add middlewares to mailapp for mail.example.com

// create app to serve static files on subdomain
var staticapp = connect()

## apicluster.js
var http = require('http'),
	ApiCluster = require('apicluster');

ApiCluster
  .defaults({
      name: 'mydefault',

      config: {
        'employee': 'emp',
        'details': 'details',

## index.html
<html>
  <head>
    <title>Social Message Board</title>
    <link rel="stylesheet" type="text/css" href="css\style.css">
  </head>
  <body>
    <div id="message-board">
      <div id="messages"></div>
      <form id="post-form">
        <input type="text" id="message" />

## BubbleSort.js
function bubbleSort(arr){
   var len = arr.length;
   for (var i = len-1; i>=0; i--){
     for(var j = 1; j<=i; j++){
       if(arr[j-1]>arr[j]){
           var temp = arr[j-1];
           arr[j-1] = arr[j];
           arr[j] = temp;
        }
     }

## SelectionSort.js
function selectionSort(arr){
  var minIdx, temp,
      len = arr.length;
  for(var i = 0; i < len; i++){
    minIdx = i;
    for(var  j = i+1; j<len; j++){
       if(arr[j]<arr[minIdx]){
          minIdx = j;
       }
    }

## InsertionSort.js
function insertionSort(arr){
  var i, len = arr.length, el, j;

  for(i = 1; i<len; i++){
    el = arr[i];
    j = i;

    while(j>0 && arr[j-1]>toInsert){
      arr[j] = arr[j-1];
      j--;

## MergeSort.js
function mergeSort(arr){
   var len = arr.length;
   if(len <2)
      return arr;
   var mid = Math.floor(len/2),
       left = arr.slice(0,mid),
       right =arr.slice(mid);
   //send left and right to the mergeSort to broke it down into pieces
   //then merge those
   return merge(mergeSort(left),mergeSort(right));

## QuickSort.js
function quickSort(arr, left, right){
   var len = arr.length,
   pivot,
   partitionIndex;


  if(left < right){
    pivot = right;
    partitionIndex = partition(arr, pivot, left, right);


## HeapSort.js
function heapSort(arr){
  var len = arr.length,
      end = len-1;

  heapify(arr, len);

  while(end > 0){
   swap(arr, end--, 0);
   siftDown(arr, 0, end);
  }

## Gruntfile.js
module.exports = function( grunt ) {
  'use strict';

  // Load grunt tasks automatically
  require( 'load-grunt-tasks' )( grunt );

  grunt.loadTasks( 'tasks' );

  // Time how long tasks take. Can help when optimizing build times
  require( 'time-grunt' )( grunt );
	var connect = require('connect'),
	serveStatic = require('serve-static'),
	vhost = require('vhost')

	var mailapp = connect()

	// add middlewares to mailapp for mail.example.com

	// create app to serve static files on subdomain
	var staticapp = connect()
	var http = require('http'),
	ApiCluster = require('apicluster');

	ApiCluster
	.defaults({
	name: 'mydefault',

	config: {
	'employee': 'emp',
	'details': 'details',
	<html>
	<head>
	<title>Social Message Board</title>
	<link rel="stylesheet" type="text/css" href="css\style.css">
	</head>
	<body>
	<div id="message-board">
	<div id="messages"></div>
	<form id="post-form">
	<input type="text" id="message" />
	function bubbleSort(arr){
	var len = arr.length;
	for (var i = len-1; i>=0; i--){
	for(var j = 1; j<=i; j++){
	if(arr[j-1]>arr[j]){
	var temp = arr[j-1];
	arr[j-1] = arr[j];
	arr[j] = temp;
	}
	}
	function selectionSort(arr){
	var minIdx, temp,
	len = arr.length;
	for(var i = 0; i < len; i++){
	minIdx = i;
	for(var j = i+1; j<len; j++){
	if(arr[j]<arr[minIdx]){
	minIdx = j;
	}
	}
	function insertionSort(arr){
	var i, len = arr.length, el, j;

	for(i = 1; i<len; i++){
	el = arr[i];
	j = i;

	while(j>0 && arr[j-1]>toInsert){
	arr[j] = arr[j-1];
	j--;
	function mergeSort(arr){
	var len = arr.length;
	if(len <2)
	return arr;
	var mid = Math.floor(len/2),
	left = arr.slice(0,mid),
	right =arr.slice(mid);
	//send left and right to the mergeSort to broke it down into pieces
	//then merge those
	return merge(mergeSort(left),mergeSort(right));
	function quickSort(arr, left, right){
	var len = arr.length,
	pivot,
	partitionIndex;


	if(left < right){
	pivot = right;
	partitionIndex = partition(arr, pivot, left, right);
	function heapSort(arr){
	var len = arr.length,
	end = len-1;

	heapify(arr, len);

	while(end > 0){
	swap(arr, end--, 0);
	siftDown(arr, 0, end);
	}
	module.exports = function( grunt ) {
	'use strict';

	// Load grunt tasks automatically
	require( 'load-grunt-tasks' )( grunt );

	grunt.loadTasks( 'tasks' );

	// Time how long tasks take. Can help when optimizing build times
	require( 'time-grunt' )( grunt );