From ef336b430490821aee95c14500beb615c10472cc Mon Sep 17 00:00:00 2001 From: Quarto GHA Workflow Runner Date: Wed, 16 Oct 2024 12:36:33 +0000 Subject: [PATCH] Built site for gh-pages --- .nojekyll | 2 +- computo-quarto-extension.html | 10 +++++----- computo-quarto-extension.pdf | Bin 150339 -> 150339 bytes index.html | 10 +++++----- 4 files changed, 11 insertions(+), 11 deletions(-) diff --git a/.nojekyll b/.nojekyll index 7a429a0..b469e02 100644 --- a/.nojekyll +++ b/.nojekyll @@ -1 +1 @@ -43227e56 \ No newline at end of file +37ae3f6e \ No newline at end of file diff --git a/computo-quarto-extension.html b/computo-quarto-extension.html index 7886ed9..9e7b2fc 100644 --- a/computo-quarto-extension.html +++ b/computo-quarto-extension.html @@ -449,9 +449,9 @@

-
+
+
Figure 3: A simple ggplotly interactive example @@ -716,7 +716,7 @@

\end{algorithmic} \end{algorithm} ```

-
+
\begin{algorithm} \caption{Quicksort} \begin{algorithmic} \Procedure{Quicksort}{$A, p, r$} \If{$p < r$} \State $q = $ \Call{Partition}{$A, p, r$} \State \Call{Quicksort}{$A, p, q - 1$} \State \Call{Quicksort}{$A, q + 1, r$} \EndIf \EndProcedure \Procedure{Partition}{$A, p, r$} \State $x = A[r]$ \State $i = p - 1$ \For{$j = p, \dots, r - 1$} \If{$A[j] < x$} \State $i = i + 1$ \State exchange $A[i]$ with $A[j]$ \EndIf \State exchange $A[i]$ with $A[r]$ \EndFor \EndProcedure \end{algorithmic} \end{algorithm}
diff --git a/computo-quarto-extension.pdf b/computo-quarto-extension.pdf index 7e0726856f66c4a2aad8cbc03f19aa6244868538..efb50399cef4e8dd40b9ef537d5738453616d5f2 100644 GIT binary patch delta 202 zcmX>+jq~s{&JAwHEXJlr29v#v<-v^2xyC#6KrF+_fyNSG#%9+fA3qSw7^cd2a;~w& z<_jC-;#fh#Q81;(?fm?V+xhvKY&2Mn&5SIe5l6@V`no1V><;K!b)N%C;pS$p61SUml*&eDl~)u delta 202 zcmX>+jq~s{&JAwHEJjAgW|O^)<-v^2xyC#6KrHjgfyNSG#%9+fA3qSw5~j*>a;~w& z<_jC-;#iH0Obnu+N=*#f`S}^Q^Yb&=Xs{X?o0vc)fUN023EAzP=1i6RZf+LlhDHX4 uZf@p==0+y2hURAG7H)2aMy_UNPR6E&26hTIgq6fjPW&ggJ
-
+
+
Figure 3: A simple ggplotly interactive example @@ -716,7 +716,7 @@

\end{algorithmic} \end{algorithm} ```

-
+
\begin{algorithm} \caption{Quicksort} \begin{algorithmic} \Procedure{Quicksort}{$A, p, r$} \If{$p < r$} \State $q = $ \Call{Partition}{$A, p, r$} \State \Call{Quicksort}{$A, p, q - 1$} \State \Call{Quicksort}{$A, q + 1, r$} \EndIf \EndProcedure \Procedure{Partition}{$A, p, r$} \State $x = A[r]$ \State $i = p - 1$ \For{$j = p, \dots, r - 1$} \If{$A[j] < x$} \State $i = i + 1$ \State exchange $A[i]$ with $A[j]$ \EndIf \State exchange $A[i]$ with $A[r]$ \EndFor \EndProcedure \end{algorithmic} \end{algorithm}