Article View: comp.theory
Article #1783Wanted: Mutually Recursive, Divide-and-Conquer Algorithms
From: Mike Hilton
Date: Tue, 04 Jun 1991 17:28
Date: Tue, 04 Jun 1991 17:28
11 lines
925 bytes
925 bytes
Does anyone know of algorithms which use mutually recursive functions, each of which uses the divide-and-conquer strategy? I would like such a beast to test out a new idea for measuring algorithmic complexity. Mike Hilton Department of Computer Science University of South Carolina Columbia, SC 29208 hilton@cs.scarolina.edu
Technical Details
Message-ID:
<hilton.676056519@mimosa.cs.scarolina.edu>Path:
arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!wuarchive!uunet!europa.asd.contel.com!gatech!hubcap!ncrcae!opusc!usceast!hiltonShow Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!wuarchive!uunet!europa.asd.contel.com!gatech!hubcap!ncrcae!opusc!usceast!hilton From: hilton@cs.scarolina.edu (Mike Hilton) Newsgroups: comp.theory Subject: Wanted: Mutually Recursive, Divide-and-Conquer Algorithms Keywords: recursion, complexity, divide-and-conquer Message-ID: <hilton.676056519@mimosa.cs.scarolina.edu> Date: 4 Jun 91 17:28:39 GMT Sender: usenet@usceast.cs.scarolina.edu (USENET News System) Distribution: comp.theory Organization: USC Department of Computer Science Lines: 11