* Completed c++ implemetation
c++ implementation contained only merge function(by the name of merge sort). Completed the implementation by providing both divide and merge functions.
* fix: add triple backticks for c# code
* fix: changed csharp to cpp
* Changed the file to reflect standards
`goto` is generally discouraged for use in C++, which wasn't what this was saying. Dijkstra even [said](http://www.u.arizona.edu/~rubinson/copyright_violations/Go_To_Considered_Harmful.html), "The go to statement as it stands is just too primitive; it is too much an invitation to make a mess of one's program." in 1968. This file seemed to indicate the opposite.
* fix: fixed grammar
* Added "Note" and "Usage with common data types"
Added detailed information about the workings of 'is' and '==' operators with common data types. Included a simple coding example for each case and explained the reasons (for most cases) of why these operators work in this fashion and how they work under the hood.
* Minor changes to previous commit.
* fix: removed extra backticks
* added basic info about type safety and optionals
* add link for optionals, renamed links and title
also renamed the directory folder
* added basic info about type safety and optionals
added optionals link and renamed links and directory
* added basic info about type safety and optionals
added optionals link and renamed links and directory
* added basic info about type safety and optionals
also added "swift optionals" link and renamed original link to "type safety and type inference" and also renamed directory
* added basic info about optionals
added link to swift optionals and change the name of the first link and the directory
* added info on swift optionals
renamed links and directory folder
* added info about type safety and optionals
added a link to swift optionals and change folder name and a link's name to type safety and inference
* added info about optionals
added a link to optionals docs, change link and folder name to "type safety and inference", similarly with the title tag
* Update index.md
* Update index.md
* added info on swift optionals and type safety
altered link and directory names and added a link to optionals docs
* added info for swift type-safety and optionals
changed link and directory name to type safe and inference
added link to swift optionals doc
* Update guide/english/swift/type-safety-and-inference/index.md
Co-Authored-By: Tom <20648924+moT01@users.noreply.github.com>
* Update guide/english/swift/type-safety-and-inference/index.md
Co-Authored-By: Tom <20648924+moT01@users.noreply.github.com>
* Update guide/english/swift/type-safety-and-inference/index.md
Co-Authored-By: Tom <20648924+moT01@users.noreply.github.com>
* Update guide/english/swift/type-safety-and-inference/index.md
Co-Authored-By: Tom <20648924+moT01@users.noreply.github.com>
* Update guide/english/swift/type-safety-and-inference/index.md
Co-Authored-By: Tom <20648924+moT01@users.noreply.github.com>
* Update guide/english/swift/type-safety-and-inference/index.md
Co-Authored-By: Tom <20648924+moT01@users.noreply.github.com>
* Update guide/english/swift/type-safety-and-inference/index.md
Co-Authored-By: Tom <20648924+moT01@users.noreply.github.com>
* changed the directory name to match the title
* modified folder name to have the proper format :-)
* added info about swift dictionaries
* added info for swift dictionaries
* added info about swift dictionaries
* added basic info on swift dictionaries
* added info about swift dictionaries
* Update index.md
* added info on swift dictionaries
* added info about swift dictionaries
* Update guide/english/swift/dictionaries/index.md
Co-Authored-By: Tom <20648924+moT01@users.noreply.github.com>
* docs(guide): clean up canvas particle sim code examples
* Use ES6 syntax
* Format code for easy readability
* Normalize single vs. double quotes
* Adjust spacing
* Add link to inverse-square law wikipedia page for additional information
* docs(guide): use arrow functions in particle sim examples
Add text "### Application
1. To find all connected components in a given graph
2. To find the shortest path between two nodes of any weighted or unweighted graph
3. To find all nodes within an individual connected components" to article.
* Update index.md
I have changed the spelling such as missing letters and missing punctuation and while scanning the page, I have also adjusted a few links or coding in and out of brackets.
* Update index.md