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 'Is this public key encryption?'

Thread 'Is this public key encryption?'

I've tried to intuit public key encryption but never quite managed. But this seems to wrap it up in a bow. This seems to be a very elegant way of transmitting a message publicly that only the sender and receiver can decipher. Is this how PKE works? No, it cant be. In the above case, the requester knows the target's "secret" key - because they have his ID, and therefore knows his birthdate.
View full post »

Thread 'Who is responsible for the software when AI takes over programming?'

I tried a web search "the loss of programming ", and found an article saying that all aspects of writing, developing, and testing software programs will one day all be handled through artificial intelligence. One must wonder then, who is responsible. WHO is responsible for any problems, bugs, deficiencies, or whatever malfunctions which the programs make their users endure? Things may work wrong however the "wrong" happens. AI needs to fix the problems for the users. Any way to...
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