Skip to content

Instantly share code, notes, and snippets.

View melvincabatuan's full-sized avatar
💭
deep learning

Melvin Cabatuan melvincabatuan

💭
deep learning
View GitHub Profile
#include <iostream>
#include <limits>
using namespace std;
void display(int arr[], int length, int pass);
void selectionSort(int arr[], int length){
int i, j, min, minat;
for(i = 0; i < (length-1); i++)
#include <iostream>
using namespace std;
//============================================//
// Tree Structure
//============================================//
struct node
{
int data; // data
#include <iostream>
#include <cstdlib>
using namespace std;
class BinarySearchTree
{
private:
struct tree_node{
tree_node *left;
// Cobalt-mkc: 10/23/2019
class Node {
int data;
Node left, right;
Node(int d) {
data = d;
left = right = null;
#include <iostream>
// Cobalt-mkc: 10/23/2019
using namespace std;
//====== Empty List =========/
/* list element definition */
struct node
#include <iostream>
// Cobalt-mkc: 10/23/2019
using namespace std;
//====== Empty List =========/
/* list element definition */
struct node
#include <iostream>
// Cobalt-mkc: 10/23/2019
using namespace std;
//====== Empty List =========/
/* list element definition */
struct node
#include <iostream>
// Cobalt-mkc: 10/23/2019
using namespace std;
//====== Empty List =========/
/* list element definition */
struct node
#include <iostream>
// Cobalt-mkc: 10/23/2019
using namespace std;
//====== Empty List =========/
/* list element definition */
struct node
#include <iostream>
// Cobalt-mkc: 10/23/2019
using namespace std;
//====== Empty List =========/
/* list element definition */
struct node