Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- int checkSequence(node* atual, node* node, int num_places){
- int i;
- int sequencia_aux[6];
- memset(sequencia_aux, 0, sizeof(sequencia_aux));
- for(i =0; i<num_places; i++){
- if(atual->sequencia[i] < node->sequencia[i] && atual->sequencia[i] !=-1){
- return 0;
- }
- }
- for(i = 0;i<num_places; i++){
- if(atual->sequencia[i] > node->sequencia[i] && atual->sequencia[i] !=-1){
- printf("\nÉ MAIOR");
- atual->sequencia[i] = -1;
- }
- }
- return 1;
- }
Add Comment
Please, Sign In to add comment