Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- case:
- if(emptyP(listaprioridad)==1){
- printf("Lista Vacia\n");
- system("PAUSE");
- } else{
- resetP(&listaprioridad);
- arr = (datos*)malloc(sizeof(datos)*i);
- Mastiempo(listaprioridad,&aux2,&arr);
- for(i=0;i<*aux2; i++){
- printf("%s\n",arr[i].nomb);
- }
- system("PAUSE");
- }
- break;
- funcion
- //* Quien espero mas tiempo RECURSIVA*//
- void Mastiempo(listaP P,int *aux2,datos **arr){
- if(oosP(P)==1){
- return;
- }
- else
- **arr = copyP(P);
- forwardP(&P);
- if(retorna_resta_horasmin(**arr) > retorna_resta_horasmin(copyP(P))){
- forwardP(&P);
- *aux2 = *aux2 + 1;
- }
- else if(retorna_resta_horasmin(**arr)== retorna_resta_horasmin(copyP(P))){
- arr = arr + sizeof(datos);
- **arr=copyP(P);
- *aux2 = *aux2 + 1;
- } else if(retorna_resta_horasmin(**arr)< retorna_resta_horasmin(copyP(P))){
- **arr= copyP(P);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement