Skip to content

Commit c0ff148

Browse files
authored
Merge pull request kelvins#170 from verdade/main
Criação algorítimo busca sequencial em Go
2 parents 3ec6bd8 + a050b30 commit c0ff148

File tree

2 files changed

+20
-2
lines changed

2 files changed

+20
-2
lines changed

README.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -319,8 +319,8 @@ Com o objetivo de alcançar uma abrangência maior e encorajar mais pessoas a co
319319
</a>
320320
</td>
321321
<td> <!-- Go -->
322-
<a href="./CONTRIBUTING.md">
323-
<img align="center" height="25" src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/github/github-original.svg" />
322+
<a href="./src/go/buscasequencial.go">
323+
<img align="center" height="25" src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/go/go-original.svg" />
324324
</a>
325325
</td>
326326
<td> <!-- Ruby -->

src/go/buscasequencial.go

Lines changed: 18 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,18 @@
1+
package main
2+
3+
import "fmt"
4+
5+
func main() {
6+
myArray := []string{"c", "f", "g", "u"}
7+
fmt.Println("Element found: ", SearchPosition(myArray, "g"))
8+
fmt.Println("Element not found: ", SearchPosition(myArray, "i"))
9+
}
10+
11+
func SearchPosition(myArray []string, element string) int {
12+
for i, v := range myArray {
13+
if v == element {
14+
return i
15+
}
16+
}
17+
return -1
18+
}

0 commit comments

Comments
 (0)