Dear All,

I have moved to http://aravinthan.in/blog/ Kindly visit there and leave your comments.

#include “stdafx.h”

class Program

{

public:    

int GetNthLargestOptimized(int **intArray,int Length, int whichMax);

};

int Program::GetNthLargestOptimized(int **intArray,int Length, int whichMax)

{

int MaxIndex =0;

int MinIndex =0;

bool minFound = false;

for(int nth=0;nth<whichMax;nth++)

      {

for(int index=0;index<Length;index++)

            {

if((*intArray)[MaxIndex]< (*intArray)[index])

                  {    

                        MaxIndex = index;

                  }

if(!minFound && (*intArray)[MinIndex] > (*intArray)[index])

                  {

                        MinIndex = index;

                  }

            }

if(!minFound)

            {

                  minFound = true;

            }

if(   nth != whichMax -1)

            {

                  (*intArray)[MaxIndex]= (*intArray)[MinIndex];

            }

      }

return (*intArray)[MaxIndex];

}

int _tmain(int argc, _TCHAR* argv[])

{

      Program m;

int intNegativeArray[10]={-1,-2,-3,-4,-5,-6,-7,-8,-9,-10};

int intArray[10]={23,345,345,12,45,23,34,4,6,555};

int *intNegativePtr = intNegativeArray;

      printf(“4th Largest in Negative array:%d\n”,m.GetNthLargestOptimized(&intNegativePtr,10,4));

int *intPtr = intArray;

      printf(“4th Largest in Positive array:%d\n”,m.GetNthLargestOptimized(&intPtr,10,4));

return 0;

}

I am not able to login to my WordPress login through Firefox, dont know what fire fox doesn’t like about the WordPress.I recently upgraded the Firefox to 3.0 version from where this problem started

Am I All alone or is any one with me?

This post has been moved here: http://aravinthan.in/blog/?p=93. Please start discussing over there.

Sometimes it would be very frustrating to see our machine rebooted due to software updates. There would be instances when we would have started a long process to start and would have aborted abruptly due to the software updates from the Vista. I found a nice article from How To Geek where he has explained the above process to disable Vista from forcibly rebooting the machine. All we need to do is this:

Open up regedit.exe through the start menu search box or run dialog, and navigate down to the following key, creating new keys if they don’t exist.

HKEY_LOCAL_MACHINE\SOFTWARE\Policies\Microsoft\Windows

\WindowsUpdate\AU\

Create a new 32-bit DWORD value named NoAutoRebootWithLoggedOnUsers and give it a value of 1 to prevent automatic reboot while users are logged on. Delete the value to put things back to the way they were.

Zoomi, this  one really caught my attention. This is what technology would do as it matures. The shopping experiences would soon become to mature from a 2D to a 3D experience.

This web is a book store who get the books catalogue from Amazon and presents it in a 3D format for a pleasant experience of the user. The user would use the Amazon payment gateway for the payments. Zoomii does not even store the shipping information or any other information about the user except his email address; I guess this one is going to be a sure hit

In Mathematics Sphenic number is a postive integer which is a product of three distinct  prime numbers.

All sphenic numbers have exactly eight divisors. If we express the sphenic number as n=p.q.r, where p, q, and r are distinct primes, then the set of divisors of n will be:  {1,p,q,r,pq,pr,qr, n}.

Refer to Sphenic Number in Wiki for more details.

Selection sort is a sorting algorithm, specifically an in-place comparison sort. It has O(n2) complexity, making it inefficient on large lists, and generally performs worse than the similar insertion sort. Selection sort is noted for its simplicity, and also has performance advantages over more complicated algorithms in certain situations.

The following is my implementation of the selection sort in C# programming language

Consider sorting n numbers stored in array A by first finding the smallest element of A and exchanging it with the element in A[1]. Then find the second smallest element of A, and exchange it with A[2]. Continue in this manner for the first n – 1 elements of A.
using System;
using System.Collections.Generic;
using System.Text;

namespace Sorting
{
    class Sort
    {
        static void Main(string[] args)
        {
            List<Int32> nums = new List<int>();
            nums.Add(30);
            nums.Add(10);
            nums.Add(20);
            nums.Add(40);
            nums.Add(5);
            nums.Add(8);
            nums.Add(3);
            Sort sort = new Sort();
            //sort.DoInsertionSort(ref nums);
            sort.DoSelectionSort(ref nums);
           
            foreach(int i in nums)
            {
                Console.WriteLine(i);
            }
           
        }

        /// <summary>
        /// Selection sort algorithm involves primarily, traversing the list
        /// and then finding the least element in the array.
        /// Swapping that element with the first element of the array.
        /// We continue this process untill we hit the pen-ultimate element
        /// of the array.
        /// </summary>
        /// <param name=”numbersToBeSorted”></param>
        public void DoSelectionSort(ref List<Int32> numbersToBeSorted)
        {
            for (int index = 0; index < numbersToBeSorted.Count-1; index++)
            {
                int min = index;

                for (int secondSearch = index + 1; secondSearch < numbersToBeSorted.Count; secondSearch++)
                {
                    if (numbersToBeSorted[secondSearch] < numbersToBeSorted[min])
                    {
                        min = secondSearch;
                    }
                }
                //simple swapping of the least element with appropriate
                //key element.
                int temp = numbersToBeSorted[index];
                numbersToBeSorted[index] = numbersToBeSorted[min];
                numbersToBeSorted[min] = temp;

            }
        }
}

 /*
         *
         *  Out put would be:
            3
            5
            8
            10
            20
            30
            40
            Press any key to continue . . .
         */

I guess the answer is Θ(n^3). We always mention the highest order of the equation and we ignore the constants associated with the equation.

I wanted to write on Algorithms for a long time and here i got a chance to write on them; Today I am going to post on Insertion sort.

Insertion sort is a simple sorting algorithm, a comparison sort in which the sorted array (or list) is built one entry at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort

While implementing the insertion sort, we would try to main the following rules:

using System;
using System.Collections.Generic;
using System.Text;

namespace Sorting
{
    class InsertionSort
    {
        static void Main(string[] args)
        {
            List<Int32> nums = new List<int>();
            nums.Add(30);
            nums.Add(10);
            nums.Add(20);
            nums.Add(40);
            nums.Add(5);
            nums.Add(8);
            nums.Add(3);
            InsertionSort sort = new InsertionSort();
            sort.DoInsertionSort(ref nums);
           
            foreach(int i in nums)
            {
                Console.WriteLine(i);
            }
           
        }
        /// <summary>
        ///
        /// </summary>
        /// <param name=”numbersToBeSorted”>
        /// The array of integers which needs to be sorted.
        /// </param>
        public void DoInsertionSort(ref List<Int32> numbersToBeSorted)
        {
            for (int j = 1; j < numbersToBeSorted.Count; j++)
            {
                //The key is the one which we would compare with each of
                //the element and insert it appropriately.
                int key = numbersToBeSorted[j];

                //We just need to compare it with the previous element.         
                int i = j – 1;
                //THE AWESOME TRICK:
                // Since our state is we would always have the previous
                //elements in sorted order, we would just traverse back
                //and insert the key where the its most appropriate.
                while (i > -1 && numbersToBeSorted[i] > key)
                {
                    numbersToBeSorted[i + 1] = numbersToBeSorted[i];
                    i = i – 1;
                }
                numbersToBeSorted[i + 1] = key;
            }
        }

        /*
         *
         *  Out put would be:
            3
            5
            8
            10
            20
            30
            40
            Press any key to continue . . .
         */

    }
}

This post has been moved to http://aravinthan.in/blog/2008/04/23/hindi-is-not-the-national-language-of-india/

 Please start discussing there. Comments are closed here.

There is no National Language in India. India is a  language agnostic nation This is a good learning for me as I was made to belive from my schooling that Hindi is the national Language.. which was false!

http://en.wikipedia.org/wiki/Languages_of_India

States that,

 Article 346 of the Indian Constitution recognises Hindi in Devanāgarī script as the official language of central government India. The Constitution also allows for the continuation of use of the English language for official purposes. Article 345 provides constitutional recognition to “Official languages” of the union to include any language adopted by a state legislature as the official language of that state. In effect, there are “Official Languages at the state and center level but no one “national language”.

Official language is a language standard used only in (Central) Government documents..  By no means it is an indication to external world that “India speaks Hindi” but somehow I this precisely the same happening..

I Don’t know how we forget that we are a linguistically free nation.. 

Calling Hindi as national language is like calling india a “Hindu nation”..  Both of which are false..  Wake up indians.. 

My notion is to CREATE SOME GENERAL AWARENESS amoung us.

There are 23 Official languages as like Hindi… Please dont mention again its a National Language…

Some extracts for ppl who say since most of India is speaking Hindi so we should have hindi declared as national language.. here is why we should not:

If for some reason, if we decide and say “Hinduism is the religion of >75% of India so let us have a national religion which is Hinduism. We recognize all other religions as “official religions”, The government will endeavour to ensure that all other religion’s followers are encouraged to learn Hinduism and follow along with their own religion”. What would be your reaction ?

Now substitute Religion with Language and Hinduism with Hindi and tell me why is it still acceptable ?

Just as a religions cut across languages/regions in India, languages cut across regions and religions. All the reasons that would rule out a national religion, should IMO rule out a national language.