Exercises

1. Visit the documentation of the runtime package.
2. Create your own structure, make a slice and use the sort.Slice() to sort the elements of the slice you created.
3. Implement the quicksort algorithm in Go and sort some randomly-generated numeric data.
4. Implement a doubly linked list.
5. The implementation of tree.go is far from complete! Try to implement a function that checks whether a value can be found in the tree and another function that allows you to delete a tree node.
6. Similarly, the implementation of the linkedList.go file is also incomplete. Try to implement a function for deleting a node and another one for inserting a node somewhere inside the linked list.
7. Once again, the hash table implementation of hash.go is incomplete as it allows duplicate entries. So, implement a function that searches the hash table for a key before inserting it.