<SYSTEM_TASK:>
Solve the following problem using Python, implementing the functions described below, one line at a time
<END_TASK>
<USER_TASK:>
Description:
 def merge_and_fit(self, segment):
 """ Merges another segment with this one, ordering the points based on a distance heuristic Args: segment (:obj:`Segment`):
 Segment to merge with Returns: :obj:`Segment`: self """

        self.points = sort_segment_points(self.points, segment.points)
        return self