gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Update index.md (#27169)

Browse Source 
eliminated the unnecessary extra space before two colons.
This commit is contained in:
codexmon
2019-01-14 17:22:28 -08:00
committed by Tom
parent dcca8f7af6
commit 695e83b6b6
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
guide/english/algorithms/greedy-algorithms/index.md
View File

@ -2,7 +2,7 @@
title: Greedy Algorithms title: Greedy Algorithms
--- ---
## What is a Greedy Algorithm ## What is a Greedy Algorithm
You must have heard about a lot of algorithmic design techniques while sifting through some of the articles here. Some of them are : You must have heard about a lot of algorithmic design techniques while sifting through some of the articles here. Some of them are:
* Brute Force * Brute Force
* Divide and Conquer * Divide and Conquer
* Greedy Programming * Greedy Programming
@ -26,7 +26,7 @@ Analyzing the run time for greedy algorithms will generally be much easier than
## Interval Scheduling Problem ## Interval Scheduling Problem
Let's dive into an interesting problem that you can encounter in almost any industry or any walk of life. Some instances of the problem are as follows : Let's dive into an interesting problem that you can encounter in almost any industry or any walk of life. Some instances of the problem are as follows:
* You are given a set of N schedules of lectures for a single day at a university. The schedule for a specific lecture is of the form (s_time, f_time) where s_time represents the start time for that lecture and similarly the f_time represents the finishing time. Given a list of N lecture schedules, we need to select maximum set of lectures to be held out during the day such that **none of the lectures overlap with one another i.e. if lecture Li and Lj are included in our selection then the start time of j >= finish time of i or vice versa**. * You are given a set of N schedules of lectures for a single day at a university. The schedule for a specific lecture is of the form (s_time, f_time) where s_time represents the start time for that lecture and similarly the f_time represents the finishing time. Given a list of N lecture schedules, we need to select maximum set of lectures to be held out during the day such that **none of the lectures overlap with one another i.e. if lecture Li and Lj are included in our selection then the start time of j >= finish time of i or vice versa**.