Hallo, thanks for submitting a pull request.

But before I accept this one, you will need to make a lot of changes. As the pull request is not useful for the project in the current state.

About the content

1. Clearly describe what problem that you are even trying to solve. It's probably finding the maximum value in an array that represents a unimodal function. But that's only "partly" mentioned in a side sentence. Nobody that starts reading the article will know what that algorithm is even useful for.
2. You say, that you choose two points$m_1$ and$m_2$ via the equation. But what do you do with those points?
3. Is this related to theternary search algorithm? It might even make sense to extend that article, instead of writing a new one.
4. What's the benefit of$\phi$ in this algorithm? Why is it vital? Ternary search also has complexity$O(\log N)$, similar to this golden-section search.
5. An implementation would certainly help, as it's not trivial (and in the current form not understandable).
6. Take a look at our other pages, on how we structure example problems. It's never in the form of problem statement / input / output and we almost never read input/output via cin.
7. The problem not even closely related to the golden-section search algorithm, therefore it doesn't make any sense to include it in an article about the golden-section algorithm.

About the technical stuff

1. Read through thecontribution page, especially the general information section and the syntax section.
2. Test if you page is rendered correctly via ourpreview page.

Basically there are a lot of technical things wrong.

• The file isn't organized into any directory. You could put it in the same directory as the binary search article.
• The file doesn't have a file ending.
• Our project uses Markdown and Latex for formatting, your page doesn't, which renders it really badly: