MHB How can we implement this sort?

  • Thread starter Thread starter mathmari
  • Start date Start date
  • Tags Tags
    Sort
AI Thread Summary
The discussion revolves around a proposed sorting method that begins with a single-element sequence and involves inserting additional elements using binary search. The goal is to implement this sorting technique in O(n log n) time. Participants mention the need for an efficient data structure to facilitate quick binary search and insertion. The conversation references heapsort as a related sorting method, indicating that a tree-based data structure is involved in achieving the desired time complexity. The focus is on optimizing the insertion process to maintain efficiency throughout the sorting operation.
mathmari
Gold Member
MHB
Messages
4,984
Reaction score
7
Hey! :o

Consider the following sorting method.

Start with a sequence consisting of one element. Insert the remaining elements into the sequence one at a ime by binary search. Devise a data structure which allow you to perform binary search and insert elements quickly.

How can we implement this sort in $O(n \log n)$ time?? (Wondering)
 
Technology news on Phys.org
mathmari said:
Hey! :o

Consider the following sorting method.

Start with a sequence consisting of one element. Insert the remaining elements into the sequence one at a ime by binary search. Devise a data structure which allow you to perform binary search and insert elements quickly.

How can we implement this sort in $O(n \log n)$ time?? (Wondering)

This is known as the "heapsort" sorting method: Heapsort - Wikipedia, the free encyclopedia

Data structure involved is a tree.
 

Thread 'Learning Assembly and computer architecture for x86'

Dear Peeps I have posted a few questions about programing on this sectio of the PF forum. I want to ask you veterans how you folks learn program in assembly and about computer architecture for the x86 family. In addition to finish learning C, I am also reading the book From bits to Gates to C and Beyond. In the book, it uses the mini LC3 assembly language. I also have books on assembly programming and computer architecture. The few famous ones i have are Computer Organization and...
View full post »

Thread 'Learning data structures and algorithms in different programming languages'

I have a quick questions. I am going through a book on C programming on my own. Afterwards, I plan to go through something call data structures and algorithms on my own also in C. I also need to learn C++, Matlab and for personal interest Haskell. For the two topic of data structures and algorithms, I understand there are standard ones across all programming languages. After learning it through C, what would be the biggest issue when trying to implement the same data...
View full post »

Similar threads

MHB How to Sort Elements of a Matrix in O(n) Time Complexity?
Replies
1
Views
2K
MHB How to Efficiently Merge a Sorted List and a Pre-Order Sorted Tree?
Replies
1
Views
1K
How are there so many sorting algorithms?
Replies
10
Views
4K
MHB Stable Algorithm: Insertion, Merge, Heap, Quicksort?
Replies
11
Views
3K
Java Recursively sorting an array of strings w/o aux. parameter
Replies
7
Views
3K
MHB Binary Search Tree - Sort the same BSTree by name or by weight
Replies
3
Views
2K
How do you handle algorithms (memorize vs. reference)?
Replies
13
Views
3K
How can we define the __mult__ method to return a Complex object?
Replies
13
Views
2K
Different Node Deletion/Insertion in a Binary Search Tree
Replies
5
Views
2K
Need help with menu driven search and sort program
Replies
46
Views
9K

Hot Threads

Recent Insights

Back
Top