## Arrange Negative Then Positive Number

4-20

4-20

Maintains bucket of 0..9 or a-z

Assume that we are given n pairs of items as input, where the first item is a

Suppose an array A consists of n elements, each of which is red, white, or blue.

NO need to sort all the items.

Find the range in which [str] occurs in [array].

Given unbounded 0s followed by unbounded number of 1s, find the first index of transition.

Write a method to sort an array ot strings so that all tne anagrams are next to each other.

---

How does insertion sort work?

Give an O(n log k)-time algorithm that merges k sorted lists with a total of n

Given a set S of n integers and an integer T,

[4-33] Algorithm to determine whether there exists an i index such as ai = i given array of {a1, a2, a3 ... an}

---

Imagine you are reading in a stream of integers. Periodically, you wish

Identify the smallest element from unsorted portion and put it at the end of the sorted portion

[4-34]

---

You are given two sorted arrays, A and B, where A has a large enough buffer at the

You are given an array-like data structure Listy which lacks a size

Given a sorted array of strings that is interspersed with empty strings, write a

O(nlogn) algorithm for finding whether there exists a pair of elements, one from S1 and one