I. Now. Have. 1337. Posts

1337

Hawt. Screenshots pl0x?

Hahaaaaaaaaaaaaa!!!!! Now onto my 1337 r4nt.

IPs

An IP is a very important thing to the Internet. It uniquely identifies computers, and allows a LAN to communicate with it. There are 4 main classes of IP addresses, which are determined by the first octet of the IP address. Class A IPs consist of one network, and 3 hosts, a class B consists of 2 networks and 2 hosts, and class C IPs consist of 3 networks, and one host. There's a class E that is only used in certain countries like China, and is the basis of IPv5, which isn't populated yet.

A network address is calculated by finding the lowest address in the address block. With a 35-bit prefix, however, the last 7 bits are host, and are always set to 0.

Finding a broadcast address is done by simply changing the host portion of an IP to all 0s. This is useful to determine what range of IPs can be associated to any one network.

CIDR notation can be used in pair with an IP to give it a specific host name. CIDR notation is constructed from two strings; the IP address, and the prefix size which is the number of leading 1 bits (true) of the routing prefix, and determines the IP's subnet mask.

An IP of 34.229.192.4 /27 would mean its subnet would have to be 255.255.255.224. This is because the first 3 bits in a bit graph are 'turned on', aka given a value of 1.

1 1 1 0 0 0 0 0
_ _ _ _ _ _ _ _
128 64 32 16 8 4 2 1

By adding 128, 64 and 32, we get 224, which is the last octet of the subnet mask. 255 is used because by turning on all 8 bits in each of the first 3 octets, we get a result of 24. But because CIDR calls for 27, we must add only the first 3 bits to make the subnet mask.

No device on the same network can have the same IP address, or there will be trouble.



Sorting in computer programming

When sorting in any programming language, there are a few initial steps that must be taken.

Code:


limit = max
switch = 1
DO WHILE switch
    switch = 0
    FOR I = 1 TO (limit - 1)
        IF name$(I) > name$(I + 1) THEN
            SWAP lastname$(I), lastname$(I + 1)
            SWAP firstname$(I), firstname$(I + 1)
            SWAP class(I), class(I + 1)
            SWAP grade$(I), grade$(I + 1)
            switch = 1
            last = I
        END IF
    NEXT I

First, we must set an overall limit for the sort, otherwise, it will not know when to stop searching for data. In this example, the variable 'max' is calculated by using it as an accumulator during the initial creating of an array of the data that is to be sorted. The variable 'switch' ensures that the sort only happens once. By setting switch to 1, and setting ti to 0 immediately after the DO expression is declared, it ensures that the sort only works once. The For I = 1 to (limit - 1), we effectively do a 50-50 cut every time we search for data inside the array to sort to find a record in the array that should be sorted next. The If statement looks at the array named name$, and the array element number that is previously assigned to it from the FOR statement. If it belongs higher in the sorted list than the array element before it, the 2 elements are swapped in location. A second set to the switch variable is added to the IF statement, telling the machine that the sort isn't done yet. The only time the IF statement will not be true will be when it finds 2 array elements that are the same in content, which means that the machine has already checked both elements. This means the sort is finished.

So Mr. 1337, I'm assuming you knew all of this. And the DO WHILE switch instead of DO WHILE switch = 1, we both know why I did that.

Good luck with that.

Cirrus wrote:[...]
Sorting in computer programming

When sorting in any programming language, there are a few initial steps that must be taken.

Code:


limit = max
switch = 1
DO WHILE switch
    switch = 0
    FOR I = 1 TO (limit - 1)
        IF name$(I) > name$(I + 1) THEN
            SWAP lastname$(I), lastname$(I + 1)
            SWAP firstname$(I), firstname$(I + 1)
            SWAP class(I), class(I + 1)
            SWAP grade$(I), grade$(I + 1)
            switch = 1
            last = I
        END IF
    NEXT I

only noobs use basic
go to c
not c++, not objective-c
just c

i'd rewrite the code here but i'm too busy tinkering with my new linux box

Cirrus wrote:First, we must set an overall limit for the sort, otherwise, it will not know when to stop searching for data. In this example, the variable 'max' is calculated by using it as an accumulator during the initial creating of an array of the data that is to be sorted.

the variable name is limit, not max
unless you omitted the declaration of max, which shouldn't happen
you know why

it might also be a basic thing, idk, never bothered with it

Cirrus wrote:The variable 'switch' ensures that the sort only happens once. By setting switch to 1, and setting it to 0 immediately after the DO expression is declared, it ensures that the sort only works once.

thanks for explaining yourself twice

Cirrus wrote:The For I = 1 to (limit - 1), we effectively do a 50-50 cut every time we search for data inside the array to sort to find a record in the array that should be sorted next. The If statement looks at the array named name$, and the array element number that is previously assigned to it from the FOR statement. If it belongs higher in the sorted list than the array element before it, the 2 elements are swapped in location. A second set to the switch variable is added to the IF statement, telling the machine that the sort isn't done yet. The only time the IF statement will not be true will be when it finds 2 array elements that are the same in content, which means that the machine has already checked both elements. This means the sort is finished.

tl;dr: common sense, read the damn code

omfg.... NERD ALERT! I couldnt understand a single word you guys both said *twitches*

Bambii wrote:omfg.... NERD ALERT! I couldnt understand a single word you guys both said *twitches*

The word you're looking for is g33k alert, not nerd alert. Nerds are geeks who have no 1337, simply the appearance of a geek.

Varry, I use C++, but haven't learned enough about it yet to make a sort. >.>
I'll be learning C# soon, making C++ past news to me. Have fun with your soon-to-be updated language.

Also, it doesn't matter whether it's limit or max for the very first part cuz they're set equal to each other before the sort even starts.

c# is microsoft, c++ is unix
they're also quite different

also i didn't say c++, i said c; c's syntax is different

although i like that beginning thing, in c you have to declare them before doing anything at all

lol wut?

Bambii wrote:omfg.... NERD ALERT! I couldnt understand a single word you guys both said *twitches*

Not our fault you're not 1337.

indeed

IDC about how many posts... but seriously... wtf r u guys saying? I think ur like some robots giving us all a glimpce into the future o.o

7 wrote:

Cirrus wrote:[...]
Sorting in computer programming

When sorting in any programming language, there are a few initial steps that must be taken.

Code:


limit = max
switch = 1
DO WHILE switch
    switch = 0
    FOR I = 1 TO (limit - 1)
        IF name$(I) > name$(I + 1) THEN
            SWAP lastname$(I), lastname$(I + 1)
            SWAP firstname$(I), firstname$(I + 1)
            SWAP class(I), class(I + 1)
            SWAP grade$(I), grade$(I + 1)
            switch = 1
            last = I
        END IF
    NEXT I

only noobs use basic
go to c
not c++, not objective-c
just c

i'd rewrite the code here but i'm too busy tinkering with my new linux box

Cirrus wrote:First, we must set an overall limit for the sort, otherwise, it will not know when to stop searching for data. In this example, the variable 'max' is calculated by using it as an accumulator during the initial creating of an array of the data that is to be sorted.

the variable name is limit, not max
unless you omitted the declaration of max, which shouldn't happen
you know why

it might also be a basic thing, idk, never bothered with it

Cirrus wrote:The variable 'switch' ensures that the sort only happens once. By setting switch to 1, and setting it to 0 immediately after the DO expression is declared, it ensures that the sort only works once.

thanks for explaining yourself twice

Cirrus wrote:The For I = 1 to (limit - 1), we effectively do a 50-50 cut every time we search for data inside the array to sort to find a record in the array that should be sorted next. The If statement looks at the array named name$, and the array element number that is previously assigned to it from the FOR statement. If it belongs higher in the sorted list than the array element before it, the 2 elements are swapped in location. A second set to the switch variable is added to the IF statement, telling the machine that the sort isn't done yet. The only time the IF statement will not be true will be when it finds 2 array elements that are the same in content, which means that the machine has already checked both elements. This means the sort is finished.

tl;dr: common sense, read the damn code

you guys are so cool

you guys are nuts. @_@

it reads like a book to me, so i don't see the problem