lundi 14 septembre 2009

The best antivirus

Your antivirus protection just expired?
Your tired of slow and heavy antivirus?
Your ready to pay to get the job done ?
It's the perfect time to switch to nod32!

http://fr.wikipedia.org/wiki/NOD32
it has optimized code so the scan speed is excellent, but it's main quality is that it's light for the system, unlike most of antivirus. You will think you don't even have an antivirus! But the green eye logo on taskbar will still be there to protect you.

i'm using it for 3 years by now, and i think everybody should do the same :)
you wanna know if what i say is true?If it's the best? the best way is to try the demo of 30 days.
You can find it here : http://www.eset.com/

Sorting number in C

I was looking in the code of my homemade linkedlist in C and i thought some people could use my algorithm so i transformed it to make it works with arrays


#include
#include
#include
int compareTo(int iNumber1, int iNumber2)
{
if( iNumber1 > iNumber2)
{
return 1;
}
else if ( iNumber1 == iNumber2)
{
return 0;
}
return -1;
}

void sortIntArray(int iArray[], int arraySize, int boolIsDecreasing)
{
int sortOrder = -1;
int cptIndex ;
if( boolIsDecreasing == 0 )
{
sortOrder = 1;
}
//For each item in the list, I compare the item to each item before him
for(cptIndex = 0; cptIndex < cptindex2 ="0" item =" iArray[cptIndex];" cptindex3 =" cptIndex;">= cptIndex2 && cptIndex3 != 0; cptIndex3--)
{
iArray[cptIndex3 ] = iArray[cptIndex3 -1];
}
iArray[cptIndex2] = item;
}
}
}
return iArray;
}
int main()
{
//Little demo of it working
int cptItem;
int intList[] = {3,2,6,1,4,2,9,45,2221,-21};
printf("Array in original order \n");
for(cptItem = 0; cptItem < (sizeof(intList) / sizeof(int)); cptItem++)
{
printf("%d\n", intList[cptItem]);
}
sortIntArray( intList,(sizeof(intList) / sizeof(int)), 0);
printf("\nArray in increasing order\n");
for(cptItem = 0;cptItem < (sizeof(intList) / sizeof(int)); cptItem++)
{
printf("%d \n", intList[cptItem]);
}
sortIntArray( intList,(sizeof(intList) / sizeof(int)), 1);
printf("\nArray in decreasing order\n");
for(cptItem = 0;cptItem < (sizeof(intList) / sizeof(int)); cptItem++)
{
printf("%d \n", intList[cptItem]);
}
_getch();
}

Reverse a number in C and Java

On yahoo answer, i had to answer question like how to reverse number, so i desided to put it up
the guy who asked fisrt asked for a recursive function, so here it is


<-------C code ------->
#include
#include

int reverse( int iNumber )
{
if( iNumber >= 10 )
{
return (iNumber % 10) * pow(10, (int)log10((double)iNumber)) + reverse(iNumber / 10);
}
else
{
return iNumber;
}
}

int main()
{
printf ( "%d",reverse(123456789));
}

<------- Java code -------->

int reverse( int pNumber )
{
if( pNumber >= 10 )
{
return (int) ((pNumber % 10) * Math.pow(10, (int)Math.log10((double)pNumber)) + reverse(pNumber / 10));
}
else
{
return pNumber;
}
}


Jean-Michel
NJR-Team

dimanche 13 septembre 2009

RegnumCoaching.com

Bonjour, étant en programmation et toujours aux études, je dois répartir mon temps entre les loisirs, les projets et les cours. Pour ce faire, j'ai recours aux services de la coach professionnelle Andrée Munger. Même si mes besoins de coaching sont différents des gens sur le marché du travail et des dirigeants d'entreprises, son approche orientée solution me permet de considérer beaucoup plus d'options et cela me permet de gagner du temps, de réduire mon stress et d'augmenter ma motivation.

Tout le monde à besoin d'un coach, car on a tous du potentiel qui pourrait être découvert et ou développé, et c'est ce qui m'est arrivé.

Vous pouvez jetter un coup d'oeil sur son site web : http://www.regnumcoaching.com/
je vous souhaite une aussi belle expérience que j'ai eue.

Jean-Michel
NJR-Team

First update

Hello, well today in a physic homework break, i desided it was time to update the blog to make it look better.

I had no time to prog and edit properly the html code, so i decided to be lazy and i searched for some skin. I found a nice skin very fast because of this website http://freeskins.blogspot.com/

i had to remove some credit code that the author put on the skin but if someone is interested by who made the skin the credits are in the code.

this skin can be found at this adresse : http://freeskins.blogspot.com/2007/07/desert-sunrise-xml-skin.html

Jean-Michel
NJR-Team

jeudi 10 septembre 2009

Presentation

Hi my name is Jean-Michel
i'm from Québec and i speak french as mothertongue and english as second language

i have a DEC in program management.

i'm presently studying at university(ÉTS) at montréal in software engeneering.

i know many programation language( C, C++, C#,Java,Visual Basic, APS.net, HTML, Javascript)

also, i will soon modify the interface of the blog to make it more nice

NJR Team

Little Man Computer(LMC)

Hello, today while answering questions on yahoo@answers, i saw a question about LMC. I didnt know anything about that thing but i found out fast enough.

LMC is a instructional model of a computer, it's used to teach students about basic features of a modern computer.

it looks like a good thing to learn before assembly.

So i went on that page http://www.atkinson.yorku.ca/~sychen/research/LMC/LittleMan.html
and i started coding.

LMC is not hard it had a set of 10 instruction

INP = prompt the user to a value to put in the accumulator
OUT = output the value of the accumulator
LDA = load in the acumulator the data at the specified memory
STA = store the value of the accumulator at a specified memory
ADD = add a specified value to the accumulator
SUB = sub a specified value to the accumulator
BRZ = goto specified label if the value inside the accumulator is 0
BRP = goto to specified label if the value inside the accumulator is 0 or greater
BRA = declare a label
DAT = declare a variable
HLT = end program



after 30 min i had answer the guy question : how to do a multiplication in LMC
here i give you the code

INP
STA NUMBER1
INP
STA NUMBER2
SUB NUMBER1
BRP NO2GREATER
LDA NUMBER1
STA FACTOR
LDA NUMBER2
STA MULTIPLIER
LDA ZERO
BRZ LOOKIFZERO
NO2GREATER LDA NUMBER2
STA FACTOR
LDA NUMBER1
STA MULTIPLIER
LDA ZERO
BRZ LOOKIFZERO
LOOKIFZERO LDA NUMBER1
BRZ ISZERO
LDA NUMBER2
BRZ ISZERO
LDA ZERO
BRZ LOOPTOP
ISZERO OUT ZERO
HLT
LOOPTOP LDA RESULT
ADD FACTOR
STA RESULT
LDA MULTIPLIER
SUB ONE
BRZ LOOPEND
STA MULTIPLIER
BRP LOOPTOP
LOOPEND STA RESULT
OUT
HLT
BRA NO2GREATER
BRA LOOKIFZERO
BRA ISZERO
BRA LOOPTOP
BRA LOOPEND
NUMBER1 DAT
NUMBER2 DAT
FACTOR DAT
MULTIPLIER DAT
RESULT DAT 000
ONE DAT 001
ZERO DAT 000

hope it was usefull to someone
NJR-TEAM