建设网站企业银行,cp网站开发搭建,网站中数据查询如何做,抖音代运营培训文章目录 1.算法伪代码流程图----循环带范围1.1.算法伪代码示例图11.2.算法伪代码示例图2 2.算法伪代码流程图----循环不带范围3.算法伪代码流程图---不带行数数字4.参考文献 1.算法伪代码流程图----循环带范围
#需要插入这个宏包
\usepackage[ruled,linesnumbered]{algorithm… 文章目录 1.算法伪代码流程图----循环带范围1.1.算法伪代码示例图11.2.算法伪代码示例图2 2.算法伪代码流程图----循环不带范围3.算法伪代码流程图---不带行数数字4.参考文献 1.算法伪代码流程图----循环带范围
#需要插入这个宏包
\usepackage[ruled,linesnumbered]{algorithm2e}1.1.算法伪代码示例图1 \begin{algorithm}[H]\caption{How to write algorithms}\KwIn{this text}\KwOut{how to write algorithm with \LaTeX2e }initialization\;\While{not at end of this document}{read current\;\eIf{understand}{go to next section\;current section becomes this one\;}{go back to the beginning of current section\;}}
\end{algorithm}1.2.算法伪代码示例图2 \begin{algorithm}\caption{identifyRowContext}\KwIn{$r_i$, $Backgrd(T_i)$${T_1, T_2, \ldots, T_n}$ and similarity threshold $\theta_r$}\KwOut{$con(r_i)$}$con(r_i) \Phi$\;\For{$j 1; j \le n; j \ne i$}{float $maxSim 0$\;$r^{maxSim} \text{null}$\;\While{not end of $T_j$}{compute Jaro($r_i, r_m$) ($r_m \in T_j$)\;\If{$(Jaro(r_i, r_m) \ge \theta_r) \wedge (Jaro(r_i, r_m) \ge r^{maxSim})$}{replace $r^{maxSim}$ with $r_m$\;}}$con(r_i) con(r_i) \cup \{r^{maxSim}\}$\;}\Return $con(r_i)$\;
\end{algorithm}2.算法伪代码流程图----循环不带范围
#需要导入以下信息
\usepackage{algorithm}
\usepackage{algpseudocode}
\renewcommand{\algorithmicrequire}{\textbf{Input:}} % Use Input in the format of Algorithm
\renewcommand{\algorithmicensure}{\textbf{Output:}} % Use Output in the format of Algorithm\begin{algorithm}[h]\caption{Pseudocode of Simulated Annealing Algorithm} % 名称\begin{algorithmic}[1]\Require$x_0$: initial individual or state;$T_0$: a high enough initial temperature;$T_{min}$: the lowest limit of temperature;\Ensureoptimal state or approximate optimal state;\State set $x_0 x_{best}$, compute initial energy function $E(x_0)$;\While {$T T_{min}$}\For{$i 1$; $in$; $i$ }\State perturb current state $x_i$ for a new state $x_{new}$ and compute energy function $E(x_{new})$;\State compute $\Delta$ $E(x_{new}-E(x_{(i)})$;\If {$\Delta$$E0$} \State $x_{best} x_{new}$\Else \State the probability $P exp(-dE/T_{(i)})$;\If {$rand(0,1) P$ }\State $x_{best} x_{new}$\Else \State $x_{best} x_{best}$\EndIf\EndIf\EndFor\State $T T * $ $ \alpha$, where $\alpha$ is decay factor ;\EndWhile\end{algorithmic}
\end{algorithm}
3.算法伪代码流程图—不带行数数字
#需要导入以下宏包
\usepackage{algorithm,algorithmic}\begin{algorithm}[!ht]\caption{Power method}\label{power1}\begin{algorithmic} % 控制是否有序号\STATE step 1: $a b-1;$\STATE step 2: $c ab;$\STATE step 3: $a ab;$\STATE step 4: $b ab;$\STATE step 5: $f ab;$\end{algorithmic}
\end{algorithm}4.参考文献
[1].https://zhuanlan.zhihu.com/p/266241159
[2].https://blog.csdn.net/frx_bwcx/article/details/120641816
[3].https://blog.csdn.net/lovehuishouzan/article/details/126797276
[4].https://blog.csdn.net/qq_44425179/article/details/131591951
[5].https://zhuanlan.zhihu.com/p/618711187
