updating DIRECTORY.md

Author: github-actions

DIRECTORY.md

@@ -33,8 +33,9 @@
     * [Binary Tree](https://github.com/TheAlgorithms/Go/blob/master/data_structures/binary_tree/binary_tree.go)
     * [Btree](https://github.com/TheAlgorithms/Go/blob/master/data_structures/binary_tree/btree.go)
     * [Node](https://github.com/TheAlgorithms/Go/blob/master/data_structures/binary_tree/node.go)
-  * Dynamic-Array
+  * Dynamic Array
     * [Dynamic Array](https://github.com/TheAlgorithms/Go/blob/master/data_structures/dynamic_array/dynamic_array.go)
+    * [Dynamic Array Test](https://github.com/TheAlgorithms/Go/blob/master/data_structures/dynamic_array/dynamic_array_test.go)
   * Hashmap
     * [Hashmap](https://github.com/TheAlgorithms/Go/blob/master/data_structures/hashmap/hashmap.go)
     * [Hashmap Test](https://github.com/TheAlgorithms/Go/blob/master/data_structures/hashmap/hashmap_test.go)

data_structures/dynamic_array/dynamic_array.go

@@ -2,7 +2,7 @@
 // description: A dynamic array is quite similar to a regular array, but its size is modifiable during program runtime.
 // details: for more details check out those links below here:
 // geeks for geeks article : https://www.geeksforgeeks.org/how-do-dynamic-arrays-work/
-// We can mention that Dynamic Array is like Slice for more detail about golang slice check this articles :
+// We can mention that Dynamic Array is like Slice for more detail about `Go` Slices check those articles :
 //	https://blog.golang.org/slices-intro
 // 	https://blog.golang.org/slices
 // authors [Wesllhey Holanda](https://github.com/wesllhey), [Milad](https://github.com/miraddo)