\documentclass[12pt,oneside]{article}

\usepackage{amsmath}
\usepackage{booktabs}
\usepackage[letterpaper, margin=1in]{geometry}
\usepackage{enumitem}
\usepackage{fancyvrb}

%% comment out if you don't have MinionPro installed!
\usepackage[onlytext]{MinionPro}

\def\compare{ {\mathrm{compare}} }
\def\swap{ {\mathrm{swap}} }
\def\sort{ {\mathrm{sort}} }
\def\true{ {\mathrm{true}} }
\def\false{ {\mathrm{false}} }
\def\split{ {\mathrm{split}} }
\def\val{ {\mathrm{val}} }



%% \setlength{\topmargin}{-0.75in}
%% \addtolength{\textheight}{2.00in}
%% \setlength{\parindent}{0in}
\pagestyle{empty}

\begin{document}

\begin{center}
{\Large Lecture 09 Ticket}\hfill\emph{COSC 311: Algorithms}, Fall 2022
\end{center}

\vspace{0.25in}

\begin{minipage}{0.75\textwidth}
  \noindent{\large Name:}\ \hrulefill
  
\vspace{0.375in}

\end{minipage}

\noindent 1. Suppose $a$ is an array of binary values of size $n$. That is, for every index $i$, we $a[i] = 0$ or $1$. Give pseudocode for a procedure that sorts $a$ in $O(n)$ time.

\medskip

\noindent 2. Each row below represents a 12-bit binary integer (where the right most bit is the 1s bit, etc). Sort the list of numbers in ascending order.

\begin{verbatim}
  110110100110
  100110001001
  001000101000
  101100111001
  000010001010
  111100011100
  101111001100
  010100010010
  011011100010
\end{verbatim}

\end{document}
