Search Results

Search found 5 results on 1 pages for 'flopex'.

Page 1/1 | 1 

• Which is the best sorting algorithm: insertion,selection,bubble,shell,merge,heap,quick, or radix?

  - by flopex

  I wanted to know which of these algorithms is the best for sorting random,semi-sorted,reversed or unique data. I know that some of these are of O(n^2) and O(nlogn).

  Read the article

• How to count the number of right children in a binary tree?

  - by flopex

  How to count the number of right children in a binary tree? This means that I only want the children marked as right. Ex. (Left | Right) F(Root) G | H T U | I J The right children would be U,H,and J. What would be the algorithm to find these.

  Read the article

• How do I remove the leaves of a binary tree?

  - by flopex

  I'm trying to remove all of the leaves. I know that leaves have no children, this is what I have so far. public void removeLeaves(BinaryTree n){ if (n.left == null && n.right == null){ n = null; } if (n.left != null) removeLeaves(n.left); if (n.right != null) removeLeaves(n.right); }

  Read the article

• What happens when you deallocate a reference twice or more in c++?

  - by flopex

  int main(){ Employee *e = new Employee(); delete e; delete e; ... delete e; return 0; }

  Read the article

• What happens when you deallocate a pointer twice or more in C++?

  - by flopex

  int main(){ Employee *e = new Employee(); delete e; delete e; ... delete e; return 0; }

  Read the article

1