Search:

Type: Posts; User: NewtonApple

Search: Search took 0.01 seconds.

  1. Replies
    10
    Views
    8,169

    hm... i finally got it to work.. the order of my...

    hm... i finally got it to work.. the order of my includes makes hell of a difference..

    then:


    #include <winsock2.h>
    #include <windows.h>


    now:
  2. Replies
    10
    Views
    8,169

    Yea, ws2_32.lib was linked.. it's just that when...

    Yea, ws2_32.lib was linked.. it's just that when i define _WIN32_WINNT.. it some how blocks off winsock2.h. i'm not exactly what's the problem. :confused:
  3. Replies
    10
    Views
    8,169

    hm.. seems like i forgot to define _WIN32_WINNT...

    hm.. seems like i forgot to define _WIN32_WINNT to 0x0501.. but now when i define this, i introduced a new problem.. it seems like this defintion blocks off my winsock2.h.. anyone knows why? im...
  4. Replies
    10
    Views
    8,169

    Hm.. I'm running Windows XP... i found the...

    Hm.. I'm running Windows XP... i found the declaration of the function in winbase.h.. it's there.. i'm just not able get it to compile. i also tested this on visual studio.net.. it seems to...
  5. Replies
    10
    Views
    8,169

    CreateWaitableTimer()

    Hi there, I'm working on something where I need to create a waitable timer event to be used in conjunction of winsock overlapped i/o. for some reason when i tried to set it up using...
  6. Replies
    3
    Views
    1,180

    Hm.. it'd be helpful if you'd show some code. ...

    Hm.. it'd be helpful if you'd show some code. but one of most common errors is adding a semicolon after the looping statement:


    for ( int i = 0; i < 10; i++ ); //<---right here take the...
  7. Replies
    1
    Views
    2,125

    I'm assuming both arrays are the same size.. so...

    I'm assuming both arrays are the same size.. so here is what I think:


    void copy (int Old[], int New[], int start, int end)
    {
    if ( start == end )
    Old[start] = New[end];
    ...
  8. Replies
    8
    Views
    1,919

    You are right your method is better.. and takes...

    You are right your method is better.. and takes less memory. But since the guy started out with indexing header, I just follow whatever he has. and i must ask, what's the point of putting a sorted...
  9. Replies
    8
    Views
    1,919

    Hm.. I think the performance of our algorithms...

    Hm.. I think the performance of our algorithms are pretty similar. because ur codes are breaking the array in two, a binary tree will represent it pretty well. and since you are traversing the...
  10. Replies
    8
    Views
    1,919

    like i said i did this in a hurry... from what i...

    like i said i did this in a hurry... from what i see, obviously you didn't bother to even debug the thing. the only thing that's wrong with the code is that i use - 1 in this:


    int max =...
  11. Replies
    8
    Views
    1,919

    // max number in the array is returned.. int...

    // max number in the array is returned..
    int MaxArray(int array[], int first, int last)
    {
    if ( first == last )
    return array[last];
    else
    {
    int max = MaxArray ( array,...
Results 1 to 11 of 12