# New R Course: Writing Efficient R Code

**DataCamp Community - r programming**, and kindly contributed to R-bloggers]. (You can report issue about the content on this page here)

Want to share your content on R-bloggers? click here if you have a blog, or here if you don't.

Hello R users, we’ve got a brand new course today: Writing Efficient R Code by Colin Gillespie.

The beauty of R is that it is built for performing data analysis. The downside is that sometimes R can be slow, thereby obstructing our analysis. For this reason, it is essential to become familiar with the main techniques for speeding up your analysis, so you can reduce computational time and get insights as quickly as possible.

**Take me to chapter 1!**

Writing Efficient R Code features interactive exercises that combine high-quality video, in-browser coding, and gamification for an engaging learning experience that will make you a master in writing efficient, quick, R code!

**What you’ll learn: **

**Chapter 1: The Art of Benchmarking**

In order to make your code go faster, you need to know how long it takes to run.

**Chapter 2: Fine Tuning – Efficient Base R**

R is flexible because you can often solve a single problem in many different ways. Some ways can be several orders of magnitude faster than the others.

**Chapter 3: Diagnosing Problems – Code Profiling**

Profiling helps you locate the bottlenecks in your code.

**Chapter 4: Turbo Charged Code – Parallel Programming**

Some problems can be solved faster using multiple cores on your machine. This chapter shows you how to write R code that runs in parallel.

**Learn how to write efficient R code today!**

**leave a comment**for the author, please follow the link and comment on their blog:

**DataCamp Community - r programming**.

R-bloggers.com offers

**daily e-mail updates**about R news and tutorials about learning R and many other topics. Click here if you're looking to post or find an R/data-science job.

Want to share your content on R-bloggers? click here if you have a blog, or here if you don't.