•
•
•
•
What is DaniWeb IT Discussion Community?
You're currently browsing the Java section within the Software Development category of DaniWeb, a massive community of 402,755 software developers, web developers, Internet marketers, and tech gurus who are all enthusiastic about making contacts, networking, and learning from each other. In fact, there are 2,592 IT professionals currently interacting right now! Registration is free, only takes a minute and lets you enjoy all of the interactive features of the site.
Please support our Java advertiser: Lunarpages Java Web Hosting
Views: 1114 | Replies: 5
 |
•
•
Join Date: Mar 2005
Posts: 73
Reputation: 
Rep Power: 4
Solved Threads: 0
Junior Poster in Training
Can someone explain this sort algorithm to me and how i can make a more efficient version, justifying the changes.
for (int p = 0; p<n-1; p++)
for (int counter = 0;counter < n-1; counter++)
if (a[counter]> a[counter+1])
swap(a, counter, counter+1);
Apreciate all help.
for (int p = 0; p<n-1; p++)
for (int counter = 0;counter < n-1; counter++)
if (a[counter]> a[counter+1])
swap(a, counter, counter+1);
Apreciate all help.
•
•
Join Date: Jun 2004
Location: H4x0rville
Posts: 2,105
Reputation:
Rep Power: 9
Solved Threads: 18
•
•
Join Date: Apr 2005
Location: Pakistan
Posts: 1
Reputation:
Rep Power: 0
Solved Threads: 0
Newbie Poster
Infact there are many sort algorithms, e.g., bubble sort, quick sort, merge sort. And this is bubble sort. In this algorithm there are maximum number of comparison. So use some other algorithm for sorting.
and reply my e-mails :-)
and reply my e-mails :-)
•
•
Join Date: Mar 2004
Posts: 717
Reputation:
Rep Power: 6
Solved Threads: 29
Master Poster
Depending on the application of your sort, a radix sort might also be considered. Though not the most efficient for smaller arrays, I hear its the fastest for very large arrays. The quick sort works pretty well and fast, and its rather easy to understand so its probably your best bet to look into that.
•
•
Join Date: Jun 2004
Location: H4x0rville
Posts: 2,105
Reputation:
Rep Power: 9
Solved Threads: 18
Bubble sort is the most inefficent, and I believe that QuickInsertionSort is the most efficent.
•
•
Join Date: Nov 2004
Location: Netherlands
Posts: 5,700
Reputation:
Rep Power: 18
Solved Threads: 195
Which sorting algorithm is the most efficient depends on what is being sorted and how random (compared to the sorted state) the initial data is.
42 Private messages asking for help will be ignored
In the frozen land of Nador they were forced to eat Steve's iMinstrels, and there was much rejoicing.
In the frozen land of Nador they were forced to eat Steve's iMinstrels, and there was much rejoicing.
|
•
•
•
•
•
•
•
•
DaniWeb Java Marketplace
•
•
•
•
Currently Active Users Viewing This Thread: 1 (0 members and 1 guests)
Linear Mode
- Previous Thread: newbie... Java load large picture :) Lit'l help plez
- Next Thread: about java servlets
