in Algorithms

Hi,

Could anybody please give me hints/help on getting an algorithm to find the nth highest in an array of n numbers. Looking forward for an early reply. Thanks in advance.

With Regards

Murali

Could anybody please give me hints/help on getting an algorithm to find the nth highest in an array of n numbers. Looking forward for an early reply. Thanks in advance.

With Regards

Murali

It looks like you're new here. If you want to get involved, click one of these buttons!

- 140.8K All Categories
- 103.6K Programming Languages
- 6.4K Assembler Developer
- 401 Assembly Code Share
- 239 Getting started in assembly
- 4.6K x86 Assembly
- 1.9K Basic
- 97 Qbasic
- 39.9K C and C++
- 5.6K Beginner C/C++
- 330 C/C++ on Linux/Unix
- 450 C/C++ Windows API
- 522 C++ Builder
- 253 C++ Game Development
- 3.3K C++ MFC
- 103 C++.NET
- 404 Visual C++
- 2.9K C#
- 7.9K Delphi and Kylix
- 334 Advanced Delphi
- 360 Delphi beginners
- 4 Haskell
- 9.7K Java
- 56 Enterprise JavaBeans
- 1.3K Java Beginners
- 304 Java Server Pages
- 4.1K Pascal
- 1.3K Perl
- 11 Perl 6
- 2K PHP
- 546 Python
- 37 Ruby
- 4.4K VB.NET
- 258 Advanced VB.Net
- 1.6K VBA
- 20.8K Visual Basic
- 767 Access databases and VB
- 831 Advance Visual Basic
- 1.2K Beginner VB
- 2.6K Game programming
- 315 Console programming
- 90 DirectX Game dev
- 1 Minecraft
- 112 Newbie Game Programmers
- 2 Oculus Rift
- 9K Applications
- 1.8K Computer Graphics
- 279 3D Graphics
- 129 DirectX
- 125 OpenGL
- 740 Computer Hardware
- 9 Cooling & Overclocking
- 3.4K Database & SQL
- 1.1K Access
- 91 ADO Programming
- 288 MySQL
- 358 Oracle
- 440 SQL-Server
- 535 Electronics development
- 1.6K Matlab
- 628 Sound & Music
- 25 DirectSound
- 257 XML Development
- 3.3K Classifieds
- 199 Co-operative Projects
- 198 For sale
- 190 FreeLance Software City
- 1.9K Jobs Available
- 603 Jobs Wanted
- 209 Wanted
- 2.9K Microsoft .NET
- 1.8K ASP.NET
- 1.1K .NET General
- 22 .NET WEB-Services
- 129 .NET WinForms
- 14 .NET XML
- 50 ADO.NET
- 142 C# & VB.NET School Support
- 3.4K Miscellaneous
- 4 Join the Team
- 354 Comments on this site
- 69 Computer Emulators
- 2.1K General programming
- 187 New programming languages
- 621 Off topic board
- 200 Mobile & Wireless
- 72 Android
- 126 Palm Pilot
- 338 Multimedia
- 154 Demo programming
- 184 MP3 programming
- 0 Bash scripts
- 27 Cloud Computing
- 1 Witsbits Go Cloud
- 53 FreeBSD
- 1.7K LINUX programming
- 1 Awk scripting
- 332 Linux Support
- 0 Sed scripting
- 370 MS-DOS
- 0 Shell scripting
- 321 Windows CE & Pocket PC
- 4.1K Windows programming
- 177 COM/DCOM
- 61 Networking And Security
- 17 Windows 2003 Server
- 6 Windows Vista
- 176 Windows XP
- 939 Software Development
- 416 Algorithms
- 68 Object Orientation
- 24 RUP & UML
- 91 Project Management
- 95 Quality & Testing
- 268 Security
- 63 Evil Scripting
- 81 Hacking
- 7.7K WEB-Development
- 1.8K Active Server Pages
- 61 AJAX
- 4 Bootstrap Themes
- 55 CGI Development
- 28 ColdFusion
- 224 Flash development
- 1.4K HTML & WEB-Design
- 1.4K Internet Development
- 131 Mobile Internet & Messaging
- 211 Wireless development
- 2.2K JavaScript
- 37 JQuery
- 304 WEB Servers
- 153 Apache
- 79 IIS
- 150 WEB-Services / SOAP

## Comments

you could simply sort your array an then pick out the nth number. You can also use an altered quick-sort algorithm for this, which will not sort the whole array, but only the parts of it that are needed to get the nth highest number. (If your familiar with quick-sort, i'll explain to you how to alter it.)

tron.

: Hi,

: Could anybody please give me hints/help on getting an algorithm to find the nth highest in an array of n numbers. Looking forward for an early reply. Thanks in advance.

:

: With Regards

: Murali

:

:

Well I am familiar with quick sort algorithm. But do you think that sorting an array and finding the nth highest is most elegant way of doing it. Please do let me know. I am interested in knowing the method. I am familiar with Quick Sort Algo.

With Regards

Murali

: Hi Murali,

:

: you could simply sort your array an then pick out the nth number. You can also use an altered quick-sort algorithm for this, which will not sort the whole array, but only the parts of it that are needed to get the nth highest number. (If your familiar with quick-sort, i'll explain to you how to alter it.)

:

: tron.

:

: : Hi,

: : Could anybody please give me hints/help on getting an algorithm to find the nth highest in an array of n numbers. Looking forward for an early reply. Thanks in advance.

: :

: : With Regards

: : Murali

: :

: :

:

:

yes I think that you "somehow" have to sort the array. You need to know at least the n highest (or the m-n lowest) elements to pick out the nth highest element.

If you are looking for the 2nd, 3rd, 4th, etc. element, it could be easily done by simply cycling through the array. However, to find the 4th element is getting quite complex - just imagine to find the 100th element ...

For this, the best way would be to sort the array.

Here's the altered quick-sort algorithm in some words:

In quick-sort, you are sorting an interval end then descending into two parts of it. Sorting [1..m] ends up in [[1..p-1] [p] [p+1..m]] ([p] is the pivot element) where you know that all elements [1..p-1] <= [p] <= [p+1..m]. Instead of sorting both parts ([1..p-1] and [p+1..m]) you only sort the part where your element is in. If (p+1 <= n <= m) then you sort [p+1..m], if (1 <= n <= p-1) then you sort [1..p-1], otherwise it's [p]. You do this until you find n.

I don't know the complexity of this algo (at max. it's the complexity of quick-sort, which would be O(n*log(n)) in best case) - however, you can see that this takes much less steps than sorting the whole array with quick-sort.

If you have any further questions, or if you find a better (less complexity) algo, please let me know - that's quite an interesting thread.

tron.

: Hi tron,

: Well I am familiar with quick sort algorithm. But do you think that sorting an array and finding the nth highest is most elegant way of doing it. Please do let me know. I am interested in knowing the method. I am familiar with Quick Sort Algo.

:

: With Regards

: Murali

:

: : Hi Murali,

: :

: : you could simply sort your array an then pick out the nth number. You can also use an altered quick-sort algorithm for this, which will not sort the whole array, but only the parts of it that are needed to get the nth highest number. (If your familiar with quick-sort, i'll explain to you how to alter it.)

: :

: : tron.

: :

: : : Hi,

: : : Could anybody please give me hints/help on getting an algorithm to find the nth highest in an array of n numbers. Looking forward for an early reply. Thanks in advance.

: : :

: : : With Regards

: : : Murali

: : :

: : :

: :

: :

:

:

Thank you for the solution. I shall look into it and try to come out with the solution. Thanks once again. I shall see if there are other solutions. Thank you once again.

With Regards

Murali

: Hi Murali,

:

: yes I think that you "somehow" have to sort the array. You need to know at least the n highest (or the m-n lowest) elements to pick out the nth highest element.

:

: If you are looking for the 2nd, 3rd, 4th, etc. element, it could be easily done by simply cycling through the array. However, to find the 4th element is getting quite complex - just imagine to find the 100th element ...

:

: For this, the best way would be to sort the array.

:

: Here's the altered quick-sort algorithm in some words:

:

: In quick-sort, you are sorting an interval end then descending into two parts of it. Sorting [1..m] ends up in [[1..p-1] [p] [p+1..m]] ([p] is the pivot element) where you know that all elements [1..p-1] <= [p] <= [p+1..m]. Instead of sorting both parts ([1..p-1] and [p+1..m]) you only sort the part where your element is in. If (p+1 <= n <= m) then you sort [p+1..m], if (1 <= n <= p-1) then you sort [1..p-1], otherwise it's [p]. You do this until you find n.

:

: I don't know the complexity of this algo (at max. it's the complexity of quick-sort, which would be O(n*log(n)) in best case) - however, you can see that this takes much less steps than sorting the whole array with quick-sort.

:

: If you have any further questions, or if you find a better (less complexity) algo, please let me know - that's quite an interesting thread.

:

: tron.

:

: : Hi tron,

: : Well I am familiar with quick sort algorithm. But do you think that sorting an array and finding the nth highest is most elegant way of doing it. Please do let me know. I am interested in knowing the method. I am familiar with Quick Sort Algo.

: :

: : With Regards

: : Murali

: :

: : : Hi Murali,

: : :

: : : you could simply sort your array an then pick out the nth number. You can also use an altered quick-sort algorithm for this, which will not sort the whole array, but only the parts of it that are needed to get the nth highest number. (If your familiar with quick-sort, i'll explain to you how to alter it.)

: : :

: : : tron.

: : :

: : : : Hi,

: : : : Could anybody please give me hints/help on getting an algorithm to find the nth highest in an array of n numbers. Looking forward for an early reply. Thanks in advance.

: : : :

: : : : With Regards

: : : : Murali

: : : :

: : : :

: : :

: : :

: :

: :

:

: