Sponsored
Sponsored
This approach involves manually iterating over each element of the array using a for loop. For each element, we apply the provided function fn with the current element and its index as arguments. The result is then pushed into a new result array, which is returned at the end.
Time Complexity: O(n), where n is the number of elements in the array.
Space Complexity: O(n) for the resultant array.
1using System;
2using System.Collections.Generic;
3
4public class Program
5{
6 public static List<int> TransformArray(int[] arr, Func<int, int, int> fn)
7 {
8 List<int> result = new List<int>();
9 for (int i = 0; i < arr.Length; i++)
10 {
11 result.Add(fn(arr[i], i));
12 }
13 return result;
14 }
15
16 public static void Main()
17 {
18 int[] arr = { 1, 2, 3 };
19 List<int> result = TransformArray(arr, (n, i) => n + 1);
20 Console.WriteLine(String.Join(", ", result));
21 }
22}The C# implementation involves a method TransformArray that applies a lambda function to each element of the input array and stores results in a list.
Another approach is to use recursion to apply the function to each element in the array. We define a recursive function that processes elements by moving from the start to the end of the array, applying transformations and constructing the result array.
Time Complexity: O(n)
Space Complexity: O(n) for result array and O(n) for function call stack.
1
In the recursive C solution, a helper function transformArrayRecursive is created. It recursively calls itself to apply the function to each element, building up the result array.