Introduction:

This is the series of post that i am planning to write on the basics of successful Indian marriages. This series would also highlight the basic misconceptions in Indian mindset which needs to deal with the emerging reality that a bride /groom needs to face in their marriage life. The series would emphasis on and would get you a real perspective and the basic understanding of how a family would work in India.

Believe me as a groom I had a different perspective of what a marriage is and once i made some small but determined changes, my issues just got submerged into a blissful marriage life.

Objective:

The sole aim of the series of posts is to help a couple lead a peaceful and blissful life.

Though the series of posts are targeted to a newly wed or person intending to get wedded soon, this would also help already married couples with certain revelations that might transform their existing relationship;

Indian Marriages:

Indian Marriages are generally perceived to be not just a marriage of Individuals but of two families and their traditions. But in 20th century, reality is its about the two persons involved in the marriage unless you have a joint family.

Choosing your partner:

I am planning to list some of the basic guidelines which if followed in an arranged marriage would make married life much easier

• Choose your partner with common values and family system. Eg: Eating habits; Educational backgrounds, etc.
• Partners should have completely different hobbies or passions. This provides a lot of excitement in your life and variety to learn from each other and discuss.
• Basic traits of your partner should mirror you. Eg:  if you are a straight forward person who doesn’t like politics your partner should have similar traits to that. (This you can find out during your first meeting before your engagement, and plan your questions targeting your behavior you would want to find with your partner..).
• Share your expectations of your marriage life and seek to get your partner’s approval.

My next post would deal with specific Todos and Donts before and after marriage;

The below is my implementation of finding the nth largest(whichmax)number in the given array of integers.

This would work for both positive and negative integers. This also  affects the given array by manipulating the values of the source array. Hence if you want an non-manipulative algo, this is NOT the one.

#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;

}

Am I All alone or is any one with me?

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

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.

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 . . .
         */