paullewallencom

<!-- https://docs.github.com/en/free-pro-team@latest/graphql/overview/explorer -->
query {
  viewer {
    repositories(isFork: false) {
      totalCount
    }
  }
}

<!-- RESULTS -->

paullewallencom

#include <iostream>
#include <iomanip>
#include <fstream>
#include <termios.h>
#include <stdio.h>

using namespace std;

int main( int argc, const char *argv[] )
{

paullewallencom

#ifndef TREAP_H
#define TREAP_H

#include <climits>
#include "UniformRandom.h"
#include "dsexceptions.h"
#include <iostream>

using namespace std;

paullewallencom

#ifndef RED_BLACK_TREE_H
#define RED_BLACK_TREE_H

#include "dsexceptions.h"
#include <iostream> 

using namespace std;

template <typename Comparable>
class RedBlackTree

paullewallencom

#ifndef SPLAY_TREE_H
#define SPLAY_TREE_H

#include "dsexceptions.h"
#include <iostream>     
using namespace std;

template <typename Comparable>
class SplayTree
{

paullewallencom

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include "UniformRandom.h"
using namespace std;

void radixSortA( vector<string> & arr, int stringLen )
{
    const int BUCKETS = 256;

paullewallencom

#ifndef BINOMIAL_QUEUE_H
#define BINOMIAL_QUEUE_H

#include <iostream>
#include <vector>
#include "dsexceptions.h"
using namespace std;

template <typename Comparable>
class BinomialQueue

paullewallencom

#ifndef LEFTIST_HEAP_H
#define LEFTIST_HEAP_H

#include "dsexceptions.h"
#include <iostream>
using namespace std;

template <typename Comparable>
class LeftistHeap
{

paullewallencom

#ifndef BINARY_HEAP_H
#define BINARY_HEAP_H

#include "dsexceptions.h"
#include <vector>
using namespace std;

template <typename Comparable>
class BinaryHeap
{

paullewallencom

#include "QuadraticProbing.h"
#include <iostream>
using namespace std;

bool isPrime( int n )
{
    if( n == 2 || n == 3 )
        return true;

    if( n == 1 || n % 2 == 0 )