C / C++ / MFC

void fillArray( int N[], int T )
{
    for (int P = 0; P < T; P++)
        N[P] = (int) (rand() % 52 + 1);
}
  
void sortArray( int N[], int T )
{
}
  
void printArray( int N[], int T )
{
    printf("LOTTO PICKS\n");
  
    for (int P = 0; P < T; P++)
        printf("%d\n", N[P]);
}
  
void main( void )
{
    srand(time(NULL));
  
    int PICKED[] = {0,0,0,0,0,0};
  
    fillArray(PICKED, SIZE);
    sortArray(PICKED, SIZE);
    printArray(PICKED, SIZE);
}

#include <stdio.h>
#include <stdlib.h>
#include<time.h>

#define SIZE 6
#define MAX 53

void printArray(int N[], int T);
void fillArray(int N[], int T);

int main(void)
{
srand(time(NULL));

int PICKED[] = {0,0,0,0,0,0};

fillArray(PICKED, SIZE);
printArray(PICKED, SIZE);

return 0;
}

void fillArray(int N[], int T)
{
for(int P=0; P<SIZE; P++)
{
N[P] = rand() % 52+1;

for(int PASS=0; PASS<P; PASS++)
{
if(N[PASS] == N[P])
{
N[P] = (int) (rand()%52 +1);
P=-1;
}
}
}
}


void printArray(int N[], int T)
{
    int PASS, P;

    for(P=0; P<SIZE-1; P++)
    {

        for(PASS = P + 1; PASS < SIZE; PASS++)
        {
	    if(N[P]>N[PASS])
            {
       	        T = N[PASS];
		N[P] = N[PASS];
		N[P] = T;
            }
        }
    }

    printf("\nLOTTO PICKS\n\n");
    for(int P=0; P<SIZE; P++)
       printf("%d ", N[P]);

    printf("\n");

}

kbury wrote:

I have tried this...

kbury wrote:

P=-1;

PASS = -1;

kbury wrote:

N[P] = N[PASS];

N[PASS] = N[P];

• There are better ways for implementing the fillArray function (i.e. avoiding the 'duplicates' extraction).
• Messing up with the loop index is a very inelegant practice.
• printArray really should be called sortArray.

ram84 wrote:

"debug assertion failed" occurs in wincrore.cpp(with line no:888)

Rajesh R Subramanian wrote:

ram84 wrote:
"debug assertion failed" occurs in wincrore.cpp(with line no:888)



Open that file and check which assertion fails (hint: line no. 888).

MsmVc wrote:

can i check windows TaskManager?