From aa27a50d56e7a60901cf49ba054c08621c897cb4 Mon Sep 17 00:00:00 2001
From: leonardogonfiantini <lp.gonfiantini@gmail.com>
Date: Tue, 7 Mar 2023 14:16:29 +0100
Subject: [PATCH] Added new algorithm, reverse-array for go language

---
 algorithms/Go/arrays/reverse-array.go | 21 +++++++++++++++++++++
 1 file changed, 21 insertions(+)
 create mode 100644 algorithms/Go/arrays/reverse-array.go

diff --git a/algorithms/Go/arrays/reverse-array.go b/algorithms/Go/arrays/reverse-array.go
new file mode 100644
index 00000000..9a29e940
--- /dev/null
+++ b/algorithms/Go/arrays/reverse-array.go
@@ -0,0 +1,21 @@
+//Description : This program reverses array elements by swapping the first half part of the array
+//Time Complexity : O(n/2), where n is the array size
+//Auxiliary Space : O(1)
+
+package arrays
+
+import ("fmt")
+
+func TestReverseArray() {
+	// create an array of integers
+    arr := []int{1, 2, 3, 4, 5}
+    // get the length of the array
+    n := len(arr)
+    // iterate over half of the array and swap corresponding elements
+    for i := 0; i < n/2; i++ {
+        arr[i], arr[n-i-1] = arr[n-i-1], arr[i]
+    }
+    // print the reversed array
+    fmt.Println(arr)
+}
+