/sci/ - Science & Math » Thread #12215208

7KiB, 246x250, comfy.jpg

View Same Google iqdb SauceNAO

Anonymous Sat 10 Oct 15:28:09 2020 No.12215208 View Reply Original Report

Quoted By: >>12215251 >>12215967

Prove me wrong:
Its not possible to insert a sorted array in a binary search tree in O(n+m) time.

Protip:
You cant

Anonymous

Anonymous Sat 10 Oct 2020 15:41:56 No.12215251 Report

Quoted By:

>>12215208
Hah there's a prove that can do it in O(?(m+n)) time but I wouldn't be helping you out if I told you about it.

Anonymous

Anonymous Sat 10 Oct 2020 19:13:43 No.12215967 Report

Quoted By: >>12216075

>>12215208
You just sort straight into binary tree, by putting bigger and smaller to each elements, and then parse it by for loop.

Even pointers to pointers can align in a way, you end up with array of pointers in right order without realocating a single element which can be useful while traversing huge node like structures and sorting them for timeline in looped acyclic graph.

Anonymous

Anonymous Sat 10 Oct 2020 19:30:38 No.12216075 Report

Quoted By:

>>12215967
I dont think that runs in O(n+m) time

Capcode	All Only User Posts Only Moderator Posts Only Admin Posts Only Developer Posts
Show Posts	All Only With Images Only Without Images
Deleted Posts	All Only Deleted Posts Only Non-Deleted Posts
Ghost Posts	All Only Ghost Posts Only Non-Ghost Posts
Post Type	All Only Sticky Threads Only Opening Posts Only Reply Posts
Results	All Grouped By Threads
Order	Latest Posts First Oldest Posts First

Your latest searches