|
Ordencao_exemplo 1.0
|
| combina(vector< Solucao * > &, Solucao *) const =0 | Sort | [pure virtual] |
| divide(Solucao &, vector< Problema * > &, vector< Solucao * > &) const =0 | Sort | [pure virtual] |
| ehPequeno() const | Sort | |
| geraSolucao(Solucao &) const | Sort | |
| indPrim | Sort | [protected] |
| indUlt | Sort | [protected] |
| insertSort(Solucao &s) const | Sort | |
| limpaSub(vector< Problema * > &) const =0 | Sort | [pure virtual] |
| Sort(int, Vetor *, int, int) | Sort | |
| valorPeq() const | Sort | |
| valorPequeno | Sort | [private] |
| vetorDesordenado | Sort | [protected] |
| ~Sort() | Sort | [virtual] |