From 9f3b3446caa28e830010d2cc72c12a782fc9ab6e Mon Sep 17 00:00:00 2001 From: Christian Willner <34183939+vaeng@users.noreply.github.com> Date: Tue, 9 Jan 2024 15:41:40 +0100 Subject: [PATCH] fix: update svg url --- exercises/practice/leap/.articles/performance/content.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/exercises/practice/leap/.articles/performance/content.md b/exercises/practice/leap/.articles/performance/content.md index 7f72eb004..f28d8fae5 100644 --- a/exercises/practice/leap/.articles/performance/content.md +++ b/exercises/practice/leap/.articles/performance/content.md @@ -36,7 +36,7 @@ Calling `boost::gregorian::gregorian_calendar::is_leap_year` is almost as slow, Here is a box-plot if you want more statistical information: -![Boxplot comparing performance metrics for different algorithms. The plot displays upper and lower whiskers, quartiles, and the median, highlighting variations in data distribution. Notably, Boolean Chain exhibits the best performance with the lowest median values, followed by Chrono, Ternary, Boost, and Inverse Chain, which shows the slowest median performance among the algorithms.](https://assets.exercism.org/images/tracks/cpp/leap/leap_benchmark_boxplot_invertable.svg) +![Boxplot comparing performance metrics for different algorithms. The plot displays upper and lower whiskers, quartiles, and the median, highlighting variations in data distribution. Notably, Boolean Chain exhibits the best performance with the lowest median values, followed by Chrono, Ternary, Boost, and Inverse Chain, which shows the slowest median performance among the algorithms.](https://assets.exercism.org/images/tracks/cpp/leap/leap_benchmark_boxplot-invertable.svg) [approaches]: https://exercism.org/tracks/cpp/exercises/leap/approaches [approach-boolean-chain]: https://exercism.org/tracks/cpp/exercises/leap/approaches/boolean-chain