From f8d5986b1de711f3feef72179b57f05e0f9870e2 Mon Sep 17 00:00:00 2001
From: Jose Storopoli <jose@storopoli.io>
Date: Sun, 6 Oct 2024 19:01:55 -0300
Subject: [PATCH] fix(readme): Zig support

---
 README-pt.md | 10 +++++++++-
 README.md    | 11 ++++++++++-
 2 files changed, 19 insertions(+), 2 deletions(-)

diff --git a/README-pt.md b/README-pt.md
index 19bc19f..e20ecf3 100644
--- a/README-pt.md
+++ b/README-pt.md
@@ -1,6 +1,8 @@
 # Teoria dos Grafos e Complexidade Computacional
 
 [![CC0](https://img.shields.io/badge/License-CC0-lightgrey.svg)](https://creativecommons.org/publicdomain/zero/1.0/)
+[![C code](https://img.shields.io/badge/code-C-blue)](./code/c)
+[![Zig code](https://img.shields.io/badge/code-Zig-orange)](./code/zig)
 [![Rodar no Repl.it](https://repl.it/badge/github/storopoli/grafos-complexidade)](https://repl.it/github/storopoli/grafos-complexidade)
 [![Abrir no Gitpod](https://gitpod.io/button/open-in-gitpod.svg)](https://gitpod.io/#https://github.com/storopoli/grafos-complexidade)
 
@@ -30,9 +32,15 @@
 1. Divisão e Conquista; e
 1. Algoritmos Gulosos.
 
+## Exemplos de Código
+A principal linguagem de programação usada para os exemplos é C.
+Também há exemplos em Zig.
+Confira-os nos diretórios `code/c/` e `code/zig/`, respectivamente.
+
 ## Dependências
 
-- Compilador C/C++; e
+- Compilador C/C++;
+- (Opcional) compilador [Zig](https://ziglang.org); e
 - [`typst`](https://typst.app) para os slides.
 
 Os slides são gerados usando [Typst](https://typst.app) com GitHub Actions
diff --git a/README.md b/README.md
index 85134b2..8d333ae 100644
--- a/README.md
+++ b/README.md
@@ -1,6 +1,8 @@
 # Graph Theory and Computational Complexity
 
 [![CC0](https://img.shields.io/badge/License-CC0-lightgrey.svg)](https://creativecommons.org/publicdomain/zero/1.0/)
+[![C code](https://img.shields.io/badge/code-C-blue)](./code/c)
+[![Zig code](https://img.shields.io/badge/code-Zig-orange)](./code/zig)
 [![Run on Repl.it](https://repl.it/badge/github/storopoli/grafos-complexidade)](https://repl.it/github/storopoli/grafos-complexidade)
 [![Open in Gitpod](https://gitpod.io/button/open-in-gitpod.svg)](https://gitpod.io/#https://github.com/storopoli/grafos-complexidade)
 
@@ -30,9 +32,16 @@
 1. Divide and Conquer; and
 1. Greedy Algorithms.
 
+## Code Examples
+
+The primary programming language used for examples is C.
+Also there are [Zig](https://ziglang.org) examples.
+Check them at `code/c/` and `code/zig/` directories, respectively.
+
 ## Dependencies
 
-- C/C++ Compiler; and
+- C/C++ Compiler;
+- (Optional) [Zig](https://ziglang.org) compiler; and
 - [`typst`](https://typst.app) for the slides.
 
 The slides are generated using [Typst](https://typst.app) with GitHub Actions