Tags » Atlas

2014 vs. 1964: Numbers speak louder than words

It’s that time of year when people look back at over the year that was 2014 (1-5). The place where I work, celebrated it’s 50th anniversary. 272 more words

Science

ATLAS ANUARIO 2014

Editorial
Los Papers del año
Las publicidades
Listas: autores más citados
Los tratamientos que vienen
Nueva clasificación para psicofármacos
Un paseo por la industria
Listas: Productos bajo receta mas vendidos… 13 more words

ATLAS

Atlas, Tigres UANL Learn Copa Libertadores Rivals

The draw for the 2015 Copa Libertadores was held earlier this month, but at the time not all the participants were known. Now most of the placeholders have been replaced by actual teams, and Atlas and Tigres UANL’s full groups have been revealed. 71 more words

Soccer

W/E 21st December

I couldn’t believe it as I rolled to a halt for the fourth Monday in a row! The Atlas had been running sweetly and I had just wondered if this was going to be the week I had no problems and it dies. 356 more words

Atlas

Walter Kannemann Moves to Atlas

Atlas announced that Argentinian left-back Walter Kannemann is their newest reinforcement ahead of the Clausura 2015 season. Kannemann, 23, has spent his entire career with San Lorenzo since making his professional debut in 2009, but rumors began circulating earlier this month that he was going to change clubs. 56 more words

Soccer

W/E 14th December

Road hardening on the Atlas continues and damn if it didn’t break down again on Monday!

Got to London and stalled it in traffic (due to a limp clutch) and when I went to start it the battery was flat…Pushed it to the side of the busy A4 just off Chiswick and phoned a friend driving into the office who I’d passed a few miles back on the M4. 329 more words

Atlas

What is the purpose of swap(v, left, (left + right)/2) in K&R's qsort() implementation?

in K&R second edition, section 5.11, page 107:

void qsort(void *v[], int left, int right, int (*comp)(void *, void *)) 
{
    int i, last;
    void swap(void *v[], int, int);
    if (left >= right)
        return;
    swap(v, left, (left + right)/2);
    last = left;
    for (i = left+1; i <= right; i++)
        if ((*comp)(v[i], v) < 0) /* Here's the function call */
            swap(v, ++last, i);
    swap(v, left, last);
    qsort(v, left, last-1, comp);
    qsort(v, last+1, right, comp);
}
… 37 more words
Recent Questions - Stack Overflow