-
as seen on Programmers
- Search for 'Programmers'
I have been reading very good reviews of the books by Jon Bentley :
Programming Pearls (2nd Edition)
More Programming Pearls: Confessions of a Coder.
I know that these books have been out there for a long time and I feel bad that I haven't read either one . But it is always better late than never…
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
Hi.. Is there a place where I can find the solutions to the 'Programming Pearls' book by Jon Bentley ? I need to verify what ever little exercise problems I solve.. Thank you ..
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
Jon Bentley in Column 1 of his book programming pearls introduces a technique for sorting a sequence of non-zero positive integers using bit vectors.
I have taken the program bitsort.c from here and pasted it below:
/* Copyright (C) 1999 Lucent Technologies */
/* From 'Programming Pearls' by Jon…
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
Hello, is it just me or this code in Programming Pearls is wrong (quicksort wants 2 const voids, no?) If so, is my solution right? Apologies, just learning...
int wordncmp(char *p, char* q)
{ int n = k;
for ( ; *p == *q; p++, q++)
if (*p == 0 && --n == 0)
return 0;
return…
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
hi suppose i have following array
int a[]=new int[]{55,41,59,26,53,58,97,93};
i want to partition it around 55 so new array will be such
} 41,26,53,55,59,58,93,93};
i have done such kinds of problems myself but this is from programming pearls and here code is like this we have some array[a…
>>> More
