Complexidade de Algoritmos

Dr. Ticongolo
Aula # 2 (Pratica)
EXERCICIOS
______________________
Determine a Complexidade

2
1. // inserir um elemento num determinado array de inteiros
2. public static boolean insertOne(Integer element, Integer a[])
3. {
4. boolean resp=false;
5. for(int i=0; i<a.length; i++)
6. {
1. if (a[i]==null) {
2. a[i]=element;
3. resp=true;
4. break;
5. }
6. }
7. return resp;
8. } 3
// inserir os elementos do array “list” no array “a”, invocando o metodo //insertOne(element, a[])

1. public static String insertAll (Integer list[], Integer a[])

2. {
3. String resp=null;
4. int countInsertions=0, countFall=0;
5. for(int i=0; i<list.length;i++){
6. if(insertOne(list[i], a)){
7. countInsertions++;
8. }
9. countFall++;
10. }
11. resp=countInsertions + " elementos inseridos e "
+countFall +" nao inseridos";
12. return resp;
4
13. }
1. public static boolean removeElement(int index, Integer a[])
2. {
3. boolean resp=false;
4. if(index<a.length && a[index]!=null){
5. a[index]=null;
6. resp=true;
7. }
8. return resp;
9. }

5
1. // remove o elemento “element” no array “a”
2. public static boolean remove(Integer element, Integer
a[])
3. {
4. boolean resp=false;
5. int posicao=elementPosition(element, a);
6. if(posicao!=-1){
7. removeElement(posicao, a);
8. resp=true;
9. }
10. return resp;
11. }
6
1. private static int elementPosition(Integer element, Integer a[]){
2. for(int i=0; i<a.length; i++){
3. if(element.intValue()==a[i].intValue())
4. return i;
5. }
6. return -1;
7. }