Skip to content

Commit

Permalink
Updated description
Browse files Browse the repository at this point in the history
  • Loading branch information
hamza1886 committed Dec 13, 2020
1 parent a042cfd commit 0f7e6a2
Show file tree
Hide file tree
Showing 2 changed files with 3 additions and 3 deletions.
2 changes: 1 addition & 1 deletion README.md
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
# Solve Recurrence Relation using Master Theorem

Learn to solve recurrence relations and find asymptotic complexity using master theorem. See online [demo](http://drunkdeveloper.com/app/master-theorem).
Learn to solve recurrence relations and find asymptotic complexity of decreasing and dividing functions using master theorem. See online [demo](http://drunkdeveloper.com/app/master-theorem).

## Master Theorem

Expand Down
4 changes: 2 additions & 2 deletions index.php
Original file line number Diff line number Diff line change
Expand Up @@ -10,7 +10,7 @@
<head>
<meta charset="utf-8"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<meta name="description" content="Learn to solve recurrence relations and find asymptotic complexity using master theorem.">
<meta name="description" content="Learn to solve recurrence relations and find asymptotic complexity of decreasing and dividing functions using master theorem.">
<meta name="author" content="Hamza Rashid">
<link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/[email protected]/dist/css/bootstrap.min.css" integrity="sha384-TX8t27EcRE3e/ihU7zmQxVncDAy5uIKz4rEkgIXeMed4M0jlfIDPvg6uqKI2xXr2" crossorigin="anonymous">
<title>Solve Recurrence Relation using Master Theorem</title>
Expand All @@ -34,7 +34,7 @@
</head>
<body class="container">
<div class="h2 border-bottom my-3 pb-3">Solve Recurrence Relation using Master Theorem</div>
<p>Learn to solve recurrence relations and find asymptotic complexity using master theorem.</p>
<p>Learn to solve recurrence relations and find asymptotic complexity of decreasing and dividing functions using master theorem.</p>

<div class="h3">Master Theorem</div>
<p class="text-justify">Master theorem provides an asymptotic analysis (using Big O notation) for recurrence relations that occur in the analysis of many divide and conquer algorithms.
Expand Down

0 comments on commit 0f7e6a2

Please sign in to comment.