diff --git a/exemplos_codigos/1.c b/exemplos_codigos/1.c
new file mode 100644
index 0000000000000000000000000000000000000000..c85b138bfa6dec1549dcfc1b9975be55fca0a065
--- /dev/null
+++ b/exemplos_codigos/1.c
@@ -0,0 +1,9 @@
+void main(){
+    int a = 0, b = 0;
+
+    if(a == b) {
+        a = 1;
+    } else {
+        b = 1;
+    }
+}
\ No newline at end of file
diff --git a/exemplos_codigos/1.py b/exemplos_codigos/1.py
new file mode 100644
index 0000000000000000000000000000000000000000..033204c49edc433fb4295a970170daefca137067
--- /dev/null
+++ b/exemplos_codigos/1.py
@@ -0,0 +1,9 @@
+def main():
+    a = 0
+    b = 0
+
+    if a == b:
+        a = 1
+    else:
+        b = 1
+    return 0
\ No newline at end of file
diff --git a/exemplos_codigos/2.c b/exemplos_codigos/2.c
new file mode 100644
index 0000000000000000000000000000000000000000..f6af4bb06a6605d40080d9ed313f44ade532ee22
--- /dev/null
+++ b/exemplos_codigos/2.c
@@ -0,0 +1,26 @@
+#include <stdio.h>
+void main(){
+    int c, first, last, middle, n, search, array[100];
+    scanf("%d", &n); //number of elements
+    c = 0;
+    while(c < n) {
+        scanf("%d", &array[c]);
+        c++;
+    }
+    scanf("%d", &search); //value to find
+    first = 0; last = n - 1; middle = (first+last)/2;
+    while(array[middle] != search && first <= last) {
+        if(array[middle] < search) {
+            first = middle + 1;
+            middle = (first + last)/2;  
+        } else {
+            last = middle - 1;
+            middle = (first + last)/2;
+        }
+    }
+    if(search == array[middle]) {
+        printf("Binary search successful!\n");
+    } else {
+        printf("Search failed!\n");
+    }
+}
\ No newline at end of file
diff --git a/exemplos_codigos/2.py b/exemplos_codigos/2.py
new file mode 100644
index 0000000000000000000000000000000000000000..3c4926a079413bd3c356696fbcf4f0591748b66d
--- /dev/null
+++ b/exemplos_codigos/2.py
@@ -0,0 +1,26 @@
+def main():
+    array = [0] * 100  # Inicializa o array com 100 elementos
+    n = int(input("Enter number of elements: "))  # Número de elementos
+    c = 0
+
+    while c < n:
+        array[c] = int(input(f"Enter element {c + 1}: "))
+        c += 1
+
+    search = int(input("Enter value to find: "))  # Valor a ser encontrado
+    first = 0
+    last = n - 1
+    middle = (first + last) // 2
+
+    while array[middle] != search and first <= last:
+        if array[middle] < search:
+            first = middle + 1
+        else:
+            last = middle - 1
+        middle = (first + last) // 2
+
+    if first <= last and array[middle] == search:
+        print("Binary search successful!")
+    else:
+        print("Search failed!")
+    return 0
\ No newline at end of file
diff --git a/exemplos_codigos/2.py.png b/exemplos_codigos/2.py.png
new file mode 100644
index 0000000000000000000000000000000000000000..a1dcd15f53c6cc928f1eb72a5137620564490a91
Binary files /dev/null and b/exemplos_codigos/2.py.png differ
diff --git a/in/estrange.in b/input_isomorfismo/estrange.in
similarity index 100%
rename from in/estrange.in
rename to input_isomorfismo/estrange.in
diff --git a/in/grafo1.in b/input_isomorfismo/grafo1.in
similarity index 100%
rename from in/grafo1.in
rename to input_isomorfismo/grafo1.in
diff --git a/in/grafo2.in b/input_isomorfismo/grafo2.in
similarity index 100%
rename from in/grafo2.in
rename to input_isomorfismo/grafo2.in
diff --git a/in/ifthen.in b/input_isomorfismo/ifthen.in
similarity index 100%
rename from in/ifthen.in
rename to input_isomorfismo/ifthen.in
diff --git a/in/switch1.in b/input_isomorfismo/switch1.in
similarity index 100%
rename from in/switch1.in
rename to input_isomorfismo/switch1.in
diff --git a/in/switch2.in b/input_isomorfismo/switch2.in
similarity index 100%
rename from in/switch2.in
rename to input_isomorfismo/switch2.in