Hi Idris, 1 2 3 4 5 6 7 1 2 3 4 5 6 7 8 8 hi this is the answer? What about double 8 on the end?
Try to rewrite program this way: #define N 16 int a=[N+1]; for (i=0, i<=N; i++) a[i]=i; Easier to experiment with different N. Correct solution: 1 3 5 7.... 2 4 6 8 .... odd first, even on the end. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups-beta.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
