Question

Need help with this question.

Write a function take first n that takes a list l and an integer n as arguments. The function should return (as a new list) the first n values from the list. In the event that n is greater than the length of l , the entire list should be returned.

I know this is correct thus far

def take_first_n(l, n):
return

Answer 1

The function being written C++

#include<iostream>
using namespace std;
int list[10]; //returning list is taken as global so as to access from main()

int* take_first_n(int *l, int n) //list pointer l, and number n as parameters
{
int i,count=0; //loop variable i and counter for counter number in the list count
for(int j=0;l[j]!='';j++) //number of elements in the list being counted
   count++;
if(count<n) // checking if list is smaller than n
return l; //if list is small original list is returned
for(i=0; i<n; i++) //if n is smaller first n elements taken in new list
list[i]=l[i];
return (list); //new list is returned
}

//above code can be tested using the following sample main with hard coded list a having 10 elements

int main()
{
   int a[20]={1,2,3,4,5,6,7,8,9,11},*p,n; //*p is the list pointer
   cout<<"enter number n: "; // value of n from console
   cin>>n;
   p=take_first_n(a,n); //function call
   n=0; //n set to 0 after function call to print the list after counting no. of digits
   for(int j=0;p[j]!='';j++) // counting numbers in new list
   n++;
   for(int i=0;i<n;i++) //printing returned list
   cout<<p[i]<<' ';
   return 0;
}

The output for the two cases are:

1. when value of n less than list size:

2. when value of n is greater than number of elements in the list: