Computing desk
< November 20	<< Oct \| November \| Dec >>	November 22 >

Welcome to the Wikipedia Computing Reference Desk Archives
The page you are currently viewing is an archive page. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages.

November 21[edit]

Looking at Vines, on one's computer?[edit]

How do you look at Vines directly while on your computer (can you?). As best I can make out, vines are for your phone? When I went to the website, it tried to connect to iTunes? Can someone explain this to me?--108.46.96.174 (talk) 03:38, 21 November 2013 (UTC)[reply]

I have never been able to get a Vine to work on my PC (Windows 8, Firefox). Although it plays, it never makes sound. RNealK (talk) 03:47, 21 November 2013 (UTC)[reply]

Vine videos on web browsers are muted by default. There should be a speaker icon to click on to turn on the sound. --209.203.125.162 (talk) 02:10, 22 November 2013 (UTC)[reply]

http://seenive.com/ -- Finlay McWalterჷTalk 09:45, 21 November 2013 (UTC)[reply]

Blocked webpages[edit]

Anyone know a Firefox add on to allow the circumvention of blocked webpages by the ISP or family filter? I know of HideMyAss.com but i'd rather have an add-on if one is available. Thanks ツ Jenova 20 ^(email) 18:09, 21 November 2013 (UTC)[reply]

Whatever method you use will probably depend on how the filter works. I could see a Firefox add-on circumventing a browser-based filter, but if you must connect to a proxy server in order to get online (as is common with many "family" ISP providers), I don't think an add-on will help. OldTimeNESter (talk) 19:40, 21 November 2013 (UTC)[reply]

https://immunicity.org/ 82.44.76.14 (talk) 12:09, 22 November 2013 (UTC)[reply]

merging two linked lists in c[edit]

hello i have this code that merges two linked lists in c; however, it creates an extra node and i dont want that extra node. note i cannot cahnge the function parameters, so im not sure how to fix this. code:

struct node* Shuffle( struct node* a, struct node* b ) {
    struct node* c = (struct node*) malloc(sizeof(struct node));
    struct node* cHead = c;
    while ( a != NULL || b != NULL ) {        
        if ( a != NULL ) {
            c -> data = a -> data;
            c -> next = (struct node*) malloc(sizeof(struct node));
            c = c - >next;
            a = a -> next;
        } 
         if ( b != NULL ) {
            c -> data = b -> data;
            c -> next = (struct node*) malloc(sizeof(struct node));
            c = c - >next;
            b = b -> next;
        } 

    }
    /* print the merged linked list */
    printf("c = ");
    PrintList( cHead );
    return cHead;
}

the INCORRECT result i get is (take note of the 0 at the tail of c):

a = { 78 -> 10 -> 6 -> 3 -> NULL }
b = { 44 -> 34 -> 10 -> NULL }
c = { 78 -> 44 -> 10 -> 34 -> 6 -> 10 -> 3 -> 0 -> NULL

The result I SHOULD get is

a = { 78 -> 10 -> 6 -> 3 -> NULL }
b = { 44 -> 34 -> 10 -> NULL }
c = { 78 -> 44 -> 10 -> 34 -> 6 -> 10 -> 3 -> NULL

i understand why i get the 0 (because I malloc before the loop) but i dont know how ti correct this. someone had the same problem on stackoverflow but the solutions dont help here because i cannot modify the function parameters.

You're getting the extra entry because you're malloc'ing before you know there is another node to write to. If both lists are null, then just return a null, and put your malloc right at the beginning of the loop, not in the if statements. Katie R (talk) 20:23, 21 November 2013 (UTC)[reply]