/go-datastructures-algorithms

This work contains my study and application of data structures, algorithms and some design patterns in Go.

Primary LanguageGoMIT LicenseMIT

Go Data Structures, Algorithms and Design Patterns

In the quest to continue learning, build better softwares with efficient algorithms with thought of algorithm complexity and also deepening my understanding of Go language.

This project will be about creating data structures, algorithms and also some design patterns while studying books on it.

Data Structures

A data structure is the organization of data to reduce the storage space and to reduce difficulty while performing different tasks on the data.

Topic and Concepts Covered

  • Classification of data structures

  • Structural design patterns

  • Representation of algorithms Complexity and performance analysis

  • Brute force algorithms

  • Divide and conquer algorithms

  • Backtracking algorithms

Notes stored as go playground

DynamicArray - the array or list data structures in JavaScript and Python respectively

Pointers

Pass Function Argument by value

Pass Function Argument by reference

Nil Pointer: When you are working with pointers, there is a potential for the program to panic. To avoid panicking, you should check to see if a pointer value is nil prior to trying to access any of the fields or methods defined on it.

Different ways to create pointers

Different ways to manipulate string