J
j1mb0jay
I have started to implement my own version of a binary search tree, i use
this data structure to sort my own version of a doubly linked link list.
It seems to work rather well but i would like to try and speed it up.
Is using a Binary Search Tree as good as Quick Sort?
From what i remember from the lectures I attended they are both O ( n log
n ). I understand that both of these sorts run best when the pivot/root
item is the half value from the list. If the list is already in order
they both become O(n^2) to do nothing at all.
What is the best way of selecting Pseudo Random items from the list and
calculating which what the best pivot/root?
Regards j1mb0jay
this data structure to sort my own version of a doubly linked link list.
It seems to work rather well but i would like to try and speed it up.
Is using a Binary Search Tree as good as Quick Sort?
From what i remember from the lectures I attended they are both O ( n log
n ). I understand that both of these sorts run best when the pivot/root
item is the half value from the list. If the list is already in order
they both become O(n^2) to do nothing at all.
What is the best way of selecting Pseudo Random items from the list and
calculating which what the best pivot/root?
Regards j1mb0jay