class help

ok, still trying at this program. lots of commented code, don't pay attention. I will post my error, followed by my code:

lab2main.o(.text+0xde): In function `main':
: undefined reference to `insertclass::funcsort1(double*, int&)'
collect2: ld returned 1 exit status
make: *** [lab2main] Error 1


#include <iostream>
#include "randnum.h" //this is for my random number generator
#include "insertionclass.h"
//#include "insertionsort.h" //this is for my first sort
//#include "funcsort1.cxx"
using namespace std;

//insertionclass::insertionsort(int& N, double myarray[]); //creates for
                                                        //my first sort
void randnum(int& N, double myarray[]); //prototype for my rand numbers
//insertionclass::funcsort1(double myarray[], int& N); //calls sort1
//double funcsort1(double myarray[], int& N);
//double insertionsort(int& N, double myarray[]);

int main()
{
        insertclass insert;

//Make sure to comment everything. Tar files.
//do not output every sort, only output statistics
//convert necessary functions to classes

        int N; //size of array
        cout<<"Enter size of array.  ";
        cin>>N;

        double myarray[N]; //array where rand nums will be stored

        //funcsort1(myarray, N);
        insert.funcsort1(myarray, N);

        return 0;
}



#ifndef INSERTIONCLASSH
#define INSERTIONCLASSH

#include <iostream>
#include "funcsort1.cxx"
#include "insertionclass.cxx"


class insertclass
{
        public:
                double insertionsort(int& N, double myarray[]);
                double funcsort1(double myarray[], int& N);
};
insertclass insert;

#endif



#include<iostream>

insertclass::insertionsort(int& N, double myarray[])
{
        int counter=0, counter2=0;//counter is counting comparisons
                         //counter2 is counting the number of loops
        do
        {
                for(int unsorted = 1; unsorted < N; ++unsorted)
                {
                        double nextitem = myarray[unsorted];
                        int loc = unsorted;
                        for(;(loc > 0) && (myarray[loc - 1] > nextitem);
--loc)
                        myarray[loc] = myarray[loc-1];
                        myarray[loc] = nextitem;
                        counter++;
                }
        cout<<counter<<endl;
        funcsort1(myarray, N);
        }while(counter2<=5);
 return myarray;
};




#include<iostream>
//#include"insertionsort.h"
//#include "insertionclass.h"
using namespace std;

//double insertionsort(int& N, double myarray[]);

insertclass::funcsort1(double myarray[], int& N)
{
        int temp3=0, i=0; //my two counters for the rand nums
        randnum(N, myarray);
        insertionsort(N, myarray);
        do //this loop will print out all the numbers in my rand num
           //generator
        {
                cout<<myarray[temp3]<<endl;
                temp3++;
                i++;
        }while(i<=(N-1)); //statement so I do not exceed size of array
        return myarray[N];
}