# CLR Skipping Chapter

Page 1 of 1

## 3 Replies - 1255 Views - Last Post: 18 June 2013 - 01:49 PM

### #1 TwoOfDiamonds

• D.I.C Regular

Reputation: 54
• Posts: 272
• Joined: 27-July 12

# CLR Skipping Chapter

Posted 18 June 2013 - 01:09 PM

Hello !
I'm studying CLR book now and I was wondering whether I can skip the "Recurrences" chapter which refers to calculating running time on recurrent algorithms such as merge sort and others. Is it mandatory or very helpful or can I go further into this book without knowing this ?
Is This A Good Question/Topic? 0

## Replies To: CLR Skipping Chapter

### #2 macosxnerd101

• Self-Trained Economist

Reputation: 11034
• Posts: 41,277
• Joined: 27-December 08

## Re: CLR Skipping Chapter

Posted 18 June 2013 - 01:31 PM

You really need recurrence relations. They're incredibly important. I don't think you'll need to solve systems of recurrences at this point (those are more for discrete dynamical systems), but you should be able to solve some basic recurrences.

### #3 TwoOfDiamonds

• D.I.C Regular

Reputation: 54
• Posts: 272
• Joined: 27-July 12

## Re: CLR Skipping Chapter

Posted 18 June 2013 - 01:47 PM

Oh I trust your judgement especially on math and algorithms So I'll look into that chapter as well . Thank you !

### #4 macosxnerd101

• Self-Trained Economist

Reputation: 11034
• Posts: 41,277
• Joined: 27-December 08

## Re: CLR Skipping Chapter

Posted 18 June 2013 - 01:49 PM

Plus, recurrence relations are discrete differential equations. So you'll have a head start when you take Diff Eqs in college. Good luck!

Page 1 of 1

 .related ul { list-style-type: circle; font-size: 12px; font-weight: bold; } .related li { margin-bottom: 5px; background-position: left 7px !important; margin-left: -35px; } .related h2 { font-size: 18px; font-weight: bold; } .related a { color: blue; }