Internal sorting is a type of sorting which is used when the entire collection of data is small enough that sorting can take place within the main memory. There is no need for external memory for the execution of the sorting program. It is used when the size of the input is small.
Examples:- Bubble sort, insertion sort, quicksort, heapsort.
So, the correct answer is $(B).$