Challenge: Types and Memory Management

Challenge

In this challenge, we’ll explore how we can store data both on the stack and on the heap. This challenge is designed to assess your understanding of memory management, ownership, and lifetimes in Rust. You’re required to create a program that involves both stack-allocated and heap-allocated data, emphasizing the importance of choosing the appropriate memory allocation strategy for different scenarios.

Task

Create a program that calculates the sum of squares for a given list of numbers. However, to make things interesting, part of the list will be stored on the stack, and the other part will be stored on the heap. Given below are some instructions you’re supposed to follow:

1. Create a stack-allocated array named stack_numbers containing at least three integers of your choice.

2. Create a heap-allocated vector named heap_numbers containing at least three integers of your choice. Use the Vec type for dynamic allocation.

3. Implement a function named sum_of_squares that takes a reference to a slice of integers and calculates the sum of squares for the elements.

4. Call the sum_of_squares function twice:

   1. Once with a slice referencing the stack-allocated array.

   2. Once with a slice referencing the heap-allocated vector.

5. Print the sum of squares for both the stack-allocated and heap-allocated data.

Try it yourself

Implement the given instructions in the code block below: