Skip to content

Docs --> Solved Typo Errors #41

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Docs --> Solved Typo Errors #41

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
12 changes: 6 additions & 6 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -35,9 +35,9 @@ Topics

## Binary Search and Ternary Search
---
*Binary Search : The process of exploiting the property of an array of being sorted to arrive at answers of questions in non linear time.*
*Binary Search: The process of exploiting the property of an array of being sorted to arrive at answers of questions in non-linear time.*

*Ternary Search : The process of exploiting the property of a function having double diffrential of a constant sign to arrive to results in non linear time.*
*Ternary Search: The process of exploiting the property of a function having double differential of a constant sign to arrive to results in non-linear time.*

- Theory

Expand All @@ -53,7 +53,7 @@ Topics

## Dynamic Programming
---
*Used to solve questions which can be broken down into smaller sub problems.It involves the technique of saving the result of a problem for future reference.*
*Used to solve questions which can be broken down into smaller sub-problems. It involves the technique of saving the result of a problem for future reference.*

- Theory

Expand Down Expand Up @@ -118,7 +118,7 @@ Topics

## Greedy
---
*Greedy problems involve solving a problem statement considering the most greedy, i.e. most optimal solution at the given time without taking into consideration the future effects of it.*
*Greedy problems involve solving a problem statement considering the most greedy, i.e. most optimal solution at the given time without taking into consideration its future effects.*

- Theory

Expand Down Expand Up @@ -149,7 +149,7 @@ Topics

## Matrix Exponentiation
---
*Used to solve problems which involve finding a solution to a given series by using exponentiation property on multiplication of matrices.The complexity is thus reduced to logrithmic from linear.*
*Used to solve problems which involves finding a solution to a given series by using exponentiation property on multiplication of matrices. The complexity is thus reduced to logarithmic from linear.*

- Theory

Expand Down Expand Up @@ -242,7 +242,7 @@ Topics

- Theory

- [Hackerearth](https://www.hackerearth.com/notes/trees/) - Baisc introduction to trees and terminologies related to it by [Anuj Garg](https://www.hackerearth.com/users/anuj09garg/)
- [Hackerearth](https://www.hackerearth.com/notes/trees/) - Basic introduction to trees and terminologies related to it by [Anuj Garg](https://www.hackerearth.com/users/anuj09garg/)
- [Wikipedia](https://en.wikipedia.org/wiki/Tree_(data_structure)) - Tree (data structure)

- Questions on
Expand Down