Casey Li sometimescasey

## kbit_rev_permute.c
/*
Summer 2018
CSC263 Assignment 3 Question 4

Describe an implementation of the BITREVERSEDINCREMENT procedure on A that allows
the bit-reversal permutation on an n-element array to be performed in time O(n).

Note: compile needs -lm flag for <math.h>:
gcc -Wall -o kbit_rev_permute kbit_rev_permute.c -lm
*/

## bfs_count_paths.c
/*
Summer 2018
CSC263 Assignment 3 Question 7

We consider undirected graphs (with no weights).
Often there are multiple shortest paths between two nodes of a graph.

Describe a linear-time algorithm such that, given an undirected, unweighted graph
and two vertices u and v, the algorithm counts the number of distinct shortest paths
from u to v. Justify its correctness and the running time.

## mnist_cnn.py
# From instructions at https://www.tensorflow.org/versions/r1.0/get_started/mnist/pros

import argparse
import sys
import tensorflow as tf
import time

from tensorflow.examples.tutorials.mnist import input_data
FLAGS = None
	/*
	Summer 2018
	CSC263 Assignment 3 Question 4

	Describe an implementation of the BITREVERSEDINCREMENT procedure on A that allows
	the bit-reversal permutation on an n-element array to be performed in time O(n).

	Note: compile needs -lm flag for <math.h>:
	gcc -Wall -o kbit_rev_permute kbit_rev_permute.c -lm
	*/
	/*
	Summer 2018
	CSC263 Assignment 3 Question 7

	We consider undirected graphs (with no weights).
	Often there are multiple shortest paths between two nodes of a graph.

	Describe a linear-time algorithm such that, given an undirected, unweighted graph
	and two vertices u and v, the algorithm counts the number of distinct shortest paths
	from u to v. Justify its correctness and the running time.
	# From instructions at https://www.tensorflow.org/versions/r1.0/get_started/mnist/pros

	import argparse
	import sys
	import tensorflow as tf
	import time

	from tensorflow.examples.tutorials.mnist import input_data
	FLAGS = None