One possible answer is:

class SortedArray {
	public:
		SortedArray();
		SortedArray( const SortedArray v );

		bool binary_search( const int n );
		void insert( const int n );
		bool remove( const int n );
};

A more experienced C++ programmer may use:

		SortedArray( const SortedArray & v );

		bool binary_search( const int n ) const;

The reference for the copy constructor is required in C++ for reasons which will be made known in class. Because a binary search is likely not to modify the stored data, it should be declared to be const.