Which sorting algorithm does the following "mysterySort" code actually implement?

void mysterySort(int arr[], int n) {

int i, j;

for (i = 1; i < n; i++) {

j = i;

while (j > 0 && arr[j-1] > arr[j]) {

int temp = arr[j-1];

arr[j-1] = arr[j];

arr[j] = temp;

--j; } }

A. Bubble sort B. Insertion sort C. Selection sort D. Shell sort

zzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz

What would be the run-time to search for a value in a heap?

	A.	O(N logN)
	B.	O(N)
	C.	O(logN)
	D.	O(1)
	E.	O(N2)