Thanks a lot!

[jikibaoboken]

Thanks a lot for what you've done. Goods Luck!

[reneargento]

Thanks for the feedback. It is always great to know that the work in this repository is helping more people :)

[adityamenon]

Piling on - I didn't want to create another ticket for this - but @reneargento thanks so much for this repository.

I'm sure the academics had good reason to not publish their answers, but seeing a solution key like this gives me the confidence that I can have a go at the problems, refer to places where I'm stuck at, and also check my answers - and know that I'll never be in the "dark" without knowing if I built the right solution.

You've created a gold-mine for all students trying to self-study. Thanks again.

[reneargento]

@adityamenon thank you! Great feedbacks like these show me that the effort put into creating this repository have been worth it. I'm happy to know it is being useful to you and others.

I just updated the repository read-me by the way. The repository is now complete, with solutions to 100% of the exercises in the book!

[adityamenon]

👏 that's amazing!

[Madonahs]

@reneargento I was going through this book and wanted to confirm my answers then found this. Thank you very much for doing this. 👏👏👏

[reneargento]

Thanks for the feedback @Madonahs, I'm happy to know that the repository has been useful to you!

[KhueHoang]

You're awesome dude ,thanks for this. Quick question, what was your learning resource to actually solving these problems?

[reneargento]

Thanks @KhueHoang! To solve the problems I used mostly the book and searches on the Internet for more information on the topics.

[DeliciousOrange]

Thanks for you work, I have learned a lot.

[reneargento]

Thanks @DeliciousOrange, I'm happy to know the repository was useful.

[YaochengTong]

Thank you for your hard work!

[cpprookie]

Thanks for your hard work, best wishes for you!

[reneargento]

Thanks @YaochengTong and @cpprookie!

[falcon78]

I am currently self learning algorithms and having a resource to fact-check your answers helps sooo much ! Thank you @reneargento for creating this invaluable resource for us self learners.

[reneargento]

Thanks @falcon78, it is good to know that the repository is being useful to you!

[dragon-dreamer]

I have recently finished the book, and I'm really happy I've found this precious repository! It saved much of my time and helped with many tasks (most notably those from the last chapters). @reneargento, thank you so much for solving all the tasks, uploading the solutions to GitHub and for your aspire to fix or explain all the issues created (and especially many issues I've created, some of which were wrong)! Please, keep this repository alive, as it will surely help many more people in the future.

[reneargento]

@dragon-dreamer I'm happy the repository has been useful to you! You have made many valuable contributions to it as well, thanks for all of them!

[Calabor-Hoc]

Awesome! Even the Creative Problems have detailed answers and explanations. Thank you SO MUCH!

[reneargento]

Thanks @Calabor-Hoc!

[glucu]

I'll like to point out in Chapter 2/Section 1/Exercise5.txt: Condition 2: less(a[j], a[j - 1]) -> When the When the array is ordered A B C D E F G Should be: When the array is ordered.

Also, chapter2/section1/Exercise6.txt: Selection Sort does do n exchanges but it does it on itself.

[emmanuel-huitrado]

Muchísimas gracias! Esta aportación es realmente muy valiosa, es muy díficil aprender todo esto sin una guía. De verdad mil gracias por tomarte el tiempo de resolverlo y compartirlo con la comunidad. Si algún día decides venir a Guadalajara, Jal. MX., avisame y te invitaré unas cervezas y un tequila.

Saludos! 🤜🤛

[reneargento]

Gracias @emmanuel-huitrado!

[XinXiaoIsMe]

Thanks a lot! It's very useful for self learners like me. And I find a litter mistake in Chapter 2/Section 2/Exercise10_FasterMerge.java:

  int indexRight = high;
  int arrayIndex = low;

  while (indexLeft <= middle) {
      if (aux[indexLeft].compareTo(aux[indexRight]) <= 0) {
          array[arrayIndex] = aux[indexLeft];
          indexLeft++;
      } else {
          array[arrayIndex] = aux[indexRight];
          indexRight--;
      }
  
      arrayIndex++;
  }

It should be while (indexLeft <= indexRight) but not while (indexLeft <= middle) . Good Luck!

[reneargento]

Thanks @XinXiaoIsMe. About that exercise, I answered you on https://github.com/reneargento/algorithms-sedgewick-wayne/pull/243

[rlabuonora]

Thanks man! I went through the programming assignments a while ago and want to get back into reading the book, the solutions are super useful!

[reneargento]

It is good to know that the repository is being useful to you @rlabuonora!

[saraalaa]

Thank you very much