Merge branch 'master' of https://github.com/icei-pucminas/aeds2
This commit is contained in:
commit
1fabdfb0fa
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
|
|
@ -16,16 +16,16 @@ class Principal {
|
||||||
//algoritmo = new Bolha(n);
|
//algoritmo = new Bolha(n);
|
||||||
//algoritmo = new Countingsort(n);
|
//algoritmo = new Countingsort(n);
|
||||||
//algoritmo = new Heapsort(n);
|
//algoritmo = new Heapsort(n);
|
||||||
//algoritmo = new Insercao(n);
|
algoritmo = new Insercao(n);
|
||||||
//algoritmo = new Mergesort(n);
|
//algoritmo = new Mergesort(n);
|
||||||
//algoritmo = new Quicksort(n);
|
//algoritmo = new Quicksort(n);
|
||||||
algoritmo = new Selecao(n);
|
//algoritmo = new Selecao(n);
|
||||||
//algoritmo = new Shellsort(n);
|
//algoritmo = new Shellsort(n);
|
||||||
|
|
||||||
|
|
||||||
//Geracao do conjunto a ser ordenado
|
//Geracao do conjunto a ser ordenado
|
||||||
algoritmo.aleatorio();
|
//algoritmo.aleatorio();
|
||||||
//algoritmo.crescente();
|
algoritmo.crescente();
|
||||||
//algoritmo.decrescente();
|
//algoritmo.decrescente();
|
||||||
|
|
||||||
|
|
||||||
Loading…
Reference in New Issue