Problem with order of list

[Yannick]

I would like to order the list by the var distance but program will say always "Lista Vazia"

void imprime_lista (List lista){

	int vect_distance[100];
	int vect_x[100];
	int vect_y[100];
	int distancia,posicao;
	int contador=-1;
	int i=0;
	int max=0;

	List auxiliar = cria_lista(auxiliar);
	List l = lista->next;
	 
	while (l!=NULL){
		distancia=find_distance(l->info.coordenadas);
		vect_distance[i]=distancia;
		vect_x[i]=l->info.coordenadas.x;
		vect_y[i]=l->info.coordenadas.y;
		contador=contador+1;
		i=i+1;
		l=l->next;
	}

	while(vect_distance[contador]!=0){

		for(i=0;i<=contador;i++){
			
			if (vect_distance[i]>max){
				max=vect_distance[i];
				posicao=i;
			}
		}

		while(l!=NULL){
			if (l->info.coordenadas.x==vect_x[posicao] && l->info.coordenadas.y==vect_y[posicao]){
				insere_lista(auxiliar,l->info);
			}
			l=l->next;
		}
		vect_distance[posicao]=0;
	}

	List x = auxiliar->next;
	
	if(x==NULL){
		printf("LISTA VAZIA!!");
	}
	
	while (x!=NULL){     
		printf("\nNome: %s", x->info.nome);
		printf("\nMorada: %s", x->info.morada);
		printf("\nE-Mail: %s", x->info.email);
		printf("\nTipo de Comida: %s", x->info.comida);
		printf("\nNumero de Telefone: %s", x->info.telefone);
		printf("\nObservações: %s", x->info.observacoes);
		printf("\nCoordenadas: %d,%d", x->info.coordenadas.x, x->info.coordenadas.y);
		switch (x->info.dia_descanso){
			case 1: printf("\nDia de descanso semanal: Domingo"); break;
            case 2: printf("\nDia de descanso semanal: Segunda-Feira"); break;
            case 3: printf("\nDia de descanso semanal: Terça-Feira"); break;
            case 4: printf("\nDia de descanso semanal: Quarta-Feira"); break;
            case 5: printf("\nDia de descanso semanal: Quinta-Feira"); break;
            case 6: printf("\nDia de descanso semanal: Sexta-Feira"); break;
            case 7: printf("\nDia de descanso semanal: Sábado"); break;
            default: printf("\n\nErro na leitura do dia de descanso!\n\n"); break;
		}
		printf("\nInicio das ferias: %d/%d", x->info.inicio_ferias.dia, x->info.inicio_ferias.mes);
		printf("\nFim das ferias: %d/%d\n", x->info.fim_ferias.dia, x->info.fim_ferias.mes);
		
		x=x->next;
	}
}

[tabstop]

I have no idea what cria_lista is supposed to do; create a list, perhaps? So since you create an auxiliar list, and then set x to be the second element of the list that doesn't have anything in it anyway, it's not surprising that x is NULL.

[Yannick]

cria_lista its create list, and "insere_lista" its put the actual lnode into a new list auxiliar...

[tabstop]

cria_lista its create list, and "insere_lista" its put the actual lnode into a new list auxiliar...

Except that never happens, since it's inside a while (l != NULL) loop; but we can only get to that loop after the previous loop finishes -- when l equals NULL.

[Yannick]

i didnt understand...sorry

[Yannick]

i dont know how to solve this...

[tabstop]

		while(l!=NULL){
			if (l->info.coordenadas.x==vect_x[posicao] && l->info.coordenadas.y==vect_y[posicao]){
				insere_lista(auxiliar,l->info);
			}
			l=l->next;
		}
		vect_distance[posicao]=0;

Where do you want l to be when this while loop starts?

[Yannick]

Before the loop i want that l is at start of the list and next to the header....what i've to do?

[tabstop]

Before the loop i want that l is at start of the list and next to the header....what i've to do?

Put it there. Assign l to the head of the list before the while loop starts.

[Yannick]

if i put List l=lista it says that there were already a definition...

[tabstop]

ASSIGN it, not DEFINE it.

[Yannick]

I've changed to this...it works but if there's 3 lists he will print 3times the same list...and not an order list..."Pesquisa special list" its a search funtion with 2 key-word and returns a list...

void imprime_lista (List lista){

	int vect_distance[100];
	int vect_x[100];
	int vect_y[100];
	int distancia,posicao;
	int contador=-1;
	int j=-1;
	int i=0;
	int max=0;

	List pesquisa = cria_lista(pesquisa);
	List auxiliar = cria_lista(auxiliar);
	List l = lista->next;
	 
	while (l!=NULL){
		distancia=find_distance(l->info.coordenadas);
		vect_distance[i]=distancia;
		vect_x[i]=l->info.coordenadas.x;
		vect_y[i]=l->info.coordenadas.y;
		contador=contador+1;
		i=i+1;
		l=l->next;
	}

	List mainlist=lista->next;

	while(mainlist!=NULL){

		for(i=0;i<=contador;i++){
			
			if (vect_distance[i]>max){
				max=vect_distance[i];
				posicao=i;
			}
		}

		pesquisa=pesquisa_lista_special(lista,vect_x[posicao],vect_y[posicao]);
		insere_lista(auxiliar,pesquisa->info);
		vect_distance[posicao]=0;
		j=j+1;
		mainlist=mainlist->next;
	}


	List x = auxiliar->next;
	
	if(x==NULL){
		printf("LISTA VAZIA!!");
	}
	
	while (x!=NULL){     
		printf("\nNome: %s", x->info.nome);
		printf("\nMorada: %s", x->info.morada);
		printf("\nE-Mail: %s", x->info.email);
		printf("\nTipo de Comida: %s", x->info.comida);
		printf("\nNumero de Telefone: %s", x->info.telefone);
		printf("\nObservações: %s", x->info.observacoes);
		printf("\nCoordenadas: %d,%d", x->info.coordenadas.x, x->info.coordenadas.y);
		switch (x->info.dia_descanso){
			case 1: printf("\nDia de descanso semanal: Domingo"); break;
            case 2: printf("\nDia de descanso semanal: Segunda-Feira"); break;
            case 3: printf("\nDia de descanso semanal: Terça-Feira"); break;
            case 4: printf("\nDia de descanso semanal: Quarta-Feira"); break;
            case 5: printf("\nDia de descanso semanal: Quinta-Feira"); break;
            case 6: printf("\nDia de descanso semanal: Sexta-Feira"); break;
            case 7: printf("\nDia de descanso semanal: Sábado"); break;
            default: printf("\n\nErro na leitura do dia de descanso!\n\n"); break;
		}
		printf("\nInicio das ferias: %d/%d", x->info.inicio_ferias.dia, x->info.inicio_ferias.mes);
		printf("\nFim das ferias: %d/%d\n", x->info.fim_ferias.dia, x->info.fim_ferias.mes);
		
		x=x->next;
	}
}

[Yannick]

it was suppose to show diferent lists by order of min vect_distance but he always print the same list...