Find a linear run-time strategy to place all records for females before any records for males? : <ol start="3">
<li>Some problems related to sorting can be solved in less than the Θ(n log n) lower bound of sorting. Consider the following scenario. A set of N records containing personnel records has a field indicating gender, male or female. Find a linear run-time strategy to place all records for females before any records for males. That is, females will be at the front of the list and males at the end. </li>
</ol>
