Small fixes
This commit is contained in:
parent
d92fc7ea20
commit
a98da53ce4
|
@ -363,9 +363,9 @@ instead of iterators:
|
||||||
|
|
||||||
\newpage
|
\newpage
|
||||||
\begin{lstlisting}
|
\begin{lstlisting}
|
||||||
sort(t, t+n);
|
sort(a, a+n);
|
||||||
reverse(t, t+n);
|
reverse(a, a+n);
|
||||||
random_shuffle(t, t+n);
|
random_shuffle(a, a+n);
|
||||||
\end{lstlisting}
|
\end{lstlisting}
|
||||||
|
|
||||||
\subsubsection{Set iterators}
|
\subsubsection{Set iterators}
|
||||||
|
@ -473,7 +473,7 @@ element that corresponds to \texttt{it} or the previous element.
|
||||||
\index{bitset}
|
\index{bitset}
|
||||||
|
|
||||||
A \key{bitset} is an array
|
A \key{bitset} is an array
|
||||||
where each element is either 0 or 1.
|
whose each value is either 0 or 1.
|
||||||
For example, the following code creates
|
For example, the following code creates
|
||||||
a bitset that contains 10 elements:
|
a bitset that contains 10 elements:
|
||||||
\begin{lstlisting}
|
\begin{lstlisting}
|
||||||
|
@ -532,7 +532,7 @@ whose size can be efficiently
|
||||||
changed at both ends of the array.
|
changed at both ends of the array.
|
||||||
Like a vector, a deque provides the functions
|
Like a vector, a deque provides the functions
|
||||||
\texttt{push\_back} and \texttt{pop\_back}, but
|
\texttt{push\_back} and \texttt{pop\_back}, but
|
||||||
it also provides the functions
|
it also includes the functions
|
||||||
\texttt{push\_front} and \texttt{pop\_front}
|
\texttt{push\_front} and \texttt{pop\_front}
|
||||||
which are not available in a vector.
|
which are not available in a vector.
|
||||||
|
|
||||||
|
@ -550,7 +550,7 @@ The internal implementation of a deque
|
||||||
is more complex than that of a vector,
|
is more complex than that of a vector,
|
||||||
and for this reason, a deque is slower than a vector.
|
and for this reason, a deque is slower than a vector.
|
||||||
Still, both adding and removing
|
Still, both adding and removing
|
||||||
elements takes $O(1)$ time on average at both ends.
|
elements take $O(1)$ time on average at both ends.
|
||||||
|
|
||||||
\subsubsection{Stack}
|
\subsubsection{Stack}
|
||||||
|
|
||||||
|
|
Loading…
Reference in New Issue