-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
2 changed files
with
3 additions
and
3 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
|
@@ -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> | ||
|
@@ -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. | ||
|