christophewang

#include <iostream>

/* Node Structure */
struct BstNode
{
    int data;
    BstNode *left;
    BstNode *right;
};

christophewang

#include <iostream>

/* Binary Search */
int binarySearch(int *array, int n, int target)
{
    int low = 0;
    int high = n - 1;

    while (low <= high)
    {

christophewang

#include <iostream>

void printArray(int *array, int n)
{
    for (int i = 0; i < n; ++i)
        std::cout << array[i] << std::endl;
}

void bubbleSort(int *array, int n)
{

christophewang

#include <iostream>

void printArray(int *array, int n)
{
    for (int i = 0; i < n; ++i)
        std::cout << array[i] << std::endl;
}

void selectionSort(int *array, int n)
{

christophewang

#include <iostream>

void printArray(int *array, int n)
{
    for (int i = 0; i < n; ++i)
        std::cout << array[i] << std::endl;
}

void insertionSort(int *array, int n)
{

christophewang

#include <iostream>

void printArray(int *array, int n)
{
    for (int i = 0; i < n; ++i)
        std::cout << array[i] << std::endl;
}

void quickSort(int *array, int low, int high)
{

christophewang

#include <iostream>

void printArray(int *array, int n)
{
    for (int i = 0; i < n; ++i)
        std::cout << array[i] << std::endl;
}

void merge(int *array, int low, int mid, int high)
{