在latex中画算法流程图

\documentclass{article}
\usepackage{amsmath}
\usepackage{algorithm}
\usepackage{algpseudocode}

\makeatletter
\def\BState{\State\hskip-\ALG@thistlm}
\makeatother

\floatname{algorithm}{Procedure}
\renewcommand{\algorithmicrequire}{\textbf{Input:}}
\renewcommand{\algorithmicensure}{\textbf{Output:}}

\begin{document}
	\begin{algorithm}
		\caption{My algorithm}\label{euclid}
		\begin{algorithmic}[1]
			\Procedure{MyProcedure}{}
			
			
				abc
			\State $\textit{stringlen} \gets \text{length of }\textit{string}$
			\State $i \gets \textit{patlen}$
			\BState \emph{top}:
			\If {$i > \textit{stringlen}$} \Return false
			\EndIf
			\State $j \gets \textit{patlen}$
			\BState \emph{loop}:
			\If {$\textit{string}(i) = \textit{path}(j)$}
			\State $j \gets j-1$.
			\State $i \gets i-1$.
			\State \textbf{goto} \emph{loop}.
			\State \textbf{close};
			\EndIf
			\State $i \gets i+\max(\textit{delta}_1(\textit{string}(i)),\textit{delta}_2(j))$.
			\State \textbf{goto} \emph{top}.
			\EndProcedure
		\end{algorithmic}
	\end{algorithm}
	
	
	
	
	\begin{algorithm}[h]
		\caption{An example for format For \& While Loop in Algorithm}
		\begin{algorithmic}[1]
			\For{each $i\in [1,9]$}
			\State initialize a tree $T_{i}$ with only a leaf (the root);
			\State $T=T\cup T_{i};$
			\EndFor
			\ForAll {$c$ such that $c\in RecentMBatch(E_{n-1})$}
			\label{code:TrainBase:getc}
			\State $T=T\cup PosSample(c)$;
			\label{code:TrainBase:pos}
			\EndFor;
			\For{$i=1$; $i<n$; $i++$ }
			\State $//$ Your source here;
			\EndFor
			\For{$i=1$ to $n$}
			\State $//$ Your source here;
			\EndFor
			\State $//$ Reusing recent base classifiers.
			\label{code:recentStart}
			\While {$(|E_n| \leq L_1 )and( D \neq \phi)$}
			\State Selecting the most recent classifier $c_i$ from $D$;
			\State $D=D-c_i$;
			\State $E_n=E_n+c_i$;
			\EndWhile
			\label{code:recentEnd}
		\end{algorithmic}
	\end{algorithm}
\end{document} 

参考：

https://en.wikibooks.org/wiki/LaTeX/Algorithms

http://blog.sina.com.cn/s/blog_5e16f1770102ezhv.html