Hello,

After looking at the queue.swift code, I request to add a stack algorithm.
I will make it based on queue.swift to make it an appropriate format.

Can I work on this code?

I will update it soon with PR.

These simple algorithms are not yet implemented in this repo. Would be useful if we can have these. And I would love to add them!

Good evening Sir, I would like to the following sorting algorithm into this repository

• Merge Sort

Do you think it will be useful? I think it will be helpful to have Merge Sort algorithm added as it's one of the most efficient and stable sorting algorithm. Thank you for your time and consideration, I look forward to hearing from you

I would like to create a new folder named "algorithms" where people can contribute algorithms in it.

Good evening Sir, I would like to add 3 implementations of checking if a string is palindrome, including implementation using for loop, recursion, and reversed() function. Do you think it will be useful?

Hello, everyone.

I've started my studies on algorithms, and I found this project pretty interesting and with lots of potential. I've already opened my first PR, and, while doing it, I've noticed we can't open the whole repository on Xcode (12.5). In order to test the code I was writing, I needed to develop it in a separate project, so I could then migrate it to this repository. I believe we can solve this issue by turning this repository into a Swift package. This would have the following advantages:

• Development right into the repository
• Possibility to add unit tests, covering the implementations
• Possibility for others to explore and learn by integrating it into existing projects

What do you think about it?

Brief Intro

Hi there 👋🏻

I would like to add an implementation and an example of using the minimax algorithm. It's an algorithm used in games for example in Tic Tac Toe, and many other games in which we are able to assess the state of the game.

Do you think it will be useful?

More Details

More about algorithm: https://en.wikipedia.org/wiki/Minimax
More about alpha-beta prunning: https://en.wikipedia.org/wiki/Alpha–beta_pruning

The following algorithms can be implemented:

1. Linear Search (Definition)
2. Binary Search (Definition)

Test array input: [10, 119, 13, 24, 53, 17, 31, 7, 19, 627, 47, 163, 37, 611, 29, 43, 51, 41, 32].
Test number input: Any suitable number can be provided here
Output: The index of the number if present