Complejidad

Article View: es.comp.ingenieria.software

Article #43

Back to es.comp.ingenieria.software Previous Next

#43

From: Jos� David Villanueva Garc�a
Date: Tue, 15 Aug 2006 13:29

15 lines
1301 bytes

Hola a tod@s. �Podr�a alguien ayudarme a obtener la complejidad de este
algoritmo?.

funcion examen( a: array [1..n] of integer; x, y : integer)
  INICIO
  si x <> y entonces
       si 2a[x] < a[y] entonces
                examen( a, x, y div 2);
       sino
                examen( a,2x, y)
       finsi
  finsi
  FIN

Muchas gracias a tod@s.

Technical Details

Message-ID: <ebsi11$3u6$1@hefestos.uned.es>

Path:

arc1-ca.pugleaf.net!g2news2.google.com!news4.google.com!news.glorb.com!news.newsland.it!newsfeed00.sul.t-online.de!t-online.de!130.59.10.21.MISMATCH!kanaga.switch.ch!switch.ch!news.rediris.es!hefestos.uned.es!not-for-mail

Show Full Headers

Complete Article Headers

X-Google-Thread: 115b4c,eb16c57d3a418c5c,start
X-Google-Attributes: gid115b4c,public
X-Google-Language: SPANISH,ASCII
Path: arc1-ca.pugleaf.net!g2news2.google.com!news4.google.com!news.glorb.com!news.newsland.it!newsfeed00.sul.t-online.de!t-online.de!130.59.10.21.MISMATCH!kanaga.switch.ch!switch.ch!news.rediris.es!hefestos.uned.es!not-for-mail
From: "Jos� David Villanueva Garc�a" <jose_david_villanueva@yahoo.es>
Newsgroups: es.comp.ingenieria.software
Subject: Complejidad
Date: Tue, 15 Aug 2006 15:29:09 +0200
Lines: 17
Message-ID: <ebsi11$3u6$1@hefestos.uned.es>
NNTP-Posting-Host: 85.59.122.231
X-Trace: hefestos.uned.es 1155648353 4038 85.59.122.231 (15 Aug 2006 13:25:53 GMT)
X-Complaints-To: admin.news@csi.uned.es
NNTP-Posting-Date: Tue, 15 Aug 2006 13:25:53 +0000 (UTC)
X-Priority: 3
X-MSMail-Priority: Normal
X-Newsreader: Microsoft Outlook Express 6.00.2800.1807
X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2800.1807