Services & Resources / Wolfram Forums
-----
 /
MathGroup Archive
1999
*January
*February
*March
*April
*May
*June
*July
*August
*September
*October
*November
*December
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 1999

[Date Index] [Thread Index] [Author Index]

Search the Archive

Sorting problem

  • To: mathgroup at smc.vnet.net
  • Subject: [mg20071] Sorting problem
  • From: Cheng Tsz Hei <s986001 at mailserv.cuhk.edu.hk>
  • Date: Wed, 29 Sep 1999 03:33:28 -0400
  • Organization: Computer Inc. Ltd.
  • Sender: owner-wri-mathgroup at wolfram.com

Dear everybody,
     Here I have some interesting problem want to share with everyone.
The problem is :
       there are n elements in the arrays and we would like to find the
second smallest
one in at most n + lgn - 2 comparsion in the worest case.
      anyone know the answer?

Maths



  • Prev by Date: Hatching a Rectangle?
  • Next by Date: iMath integrates with MathScript
  • Previous by thread: Re: Hatching a Rectangle?
  • Next by thread: Re: Sorting problem