public static function randomBoolean() { return new Boolean(Math::randomBoolean()); }
print_r($arrray); $ms = new \QW\FW\DataWorking\Sort\MergeSort($arrray); echo '<br><br>UNSORTED:::<br><br>'; print_r($ms->getOriginalArray()); echo '<br><br>SORTED BY MERGE SORT:::<br><br>'; print_r($ms->getSortedArray()); /* echo 'try Ackermann function:'; echo Math::ackermann( 2, 5 ); echo '<br>Finding Ackermnann inv:<br>'; Math::ackermannInv( 125 ) ->printMatrix(); */ echo '<br>'; var_dump(Math::randomBoolean()); $root = new TernaryTree(new BinaryTree(NULL, NULL, 1), new BinaryTree(NULL, NULL, 2), new BinaryTree(NULL, NULL, 3), 4, FALSE); echo 'Z------'; print_r($root->iteratorEulerTour()->getFinalData()); $root = NULL; $root3 = new TernaryTree(new TernaryTree(NULL, NULL, NULL, 2), new TernaryTree(NULL, NULL, NULL, 3), new TernaryTree(new TernaryTree(NULL, NULL, NULL, 5), new TernaryTree(NULL, NULL, NULL, 6), NULL, 4), 1); echo 'Euler TERNARY:<br>'; print_r($root3->iteratorEulerTour()->getFinalData()); $root3 = NULL; $root4 = new \QW\FW\DataStructures\Trees\Nary\NaryTree([new \QW\FW\DataStructures\Trees\Nary\NaryTree([], 3), new \QW\FW\DataStructures\Trees\Nary\NaryTree([], 3), new \QW\FW\DataStructures\Trees\Nary\NaryTree([new \QW\FW\DataStructures\Trees\Nary\NaryTree([], 5), new \QW\FW\DataStructures\Trees\Nary\NaryTree([], 6)], 4)], 1); $root4 = NULL; ?>