## Convert Sorted Array to Balanced Binary Search Tree (BST)

November 25, 2010

Given an array where elements are sorted in ascending order, convert it to a height balanced BST.

## Searching a 2D Sorted Matrix Part III

October 13, 2010

Write an efficient algorithm that searches for a value in an n x m table (two-dimensional array). This table is sorted along the rows and columns — that is,

Table[i][j] ≤ Table[i][j + 1],
Table[i][j] ≤ Table[i + 1][j]

## Searching a 2D Sorted Matrix Part II

October 8, 2010

Write an efficient algorithm that searches for a value in an n x m table (two-dimensional array). This table is sorted along the rows and columns — that is,

Table[i][j] ≤ Table[i][j + 1],
Table[i][j] ≤ Table[i + 1][j]

## Searching a 2D Sorted Matrix Part I

October 6, 2010

Write an efficient algorithm that searches for a value in an n x m table (two-dimensional array). This table is sorted along the rows and columns — that is,

Table[i][j] ≤ Table[i][j + 1],
Table[i][j] ≤ Table[i + 1][j]