‘ HeapSort. A compact routine that sorts data in place (no extra memory needed)’ and is guaranteed to run in O(N log N) time no matter how the input data
‘ MergeSort. A stable sort (preserves original order of records with equal ‘ keys). Like HeapSort, easily adapted to any data type and guaranteed to run ‘ in O(N log
‘ SelectionSort. Short, simple and sloooow. This is another O(N^2) sort that ‘ should never be used on long lists. Like InsertionSort,’ it needs no extra memory (in place) and
‘ 2/4/03. The previous version of ShuttleMergeSort failed on very short lists. ‘ The code below corrects the problem and eliminates a couple of unnecessary ‘ variables. Sorting times for
‘ Ternary QuickSort. See the summary of QuickSort for background before ‘ reading this one. Ternary QuickSort (also called MultiKey QuickSort) differs ‘ from the original QuickSort by examining keys
‘ this should be a module-level or global variable, so that’ Word is instantiated only onceDim MSWord As New Word.Application’ check the spelling of a word” returns True if the
‘ Getting the HTML code of any page on the web’ NOTE: requires the Microsoft XML library’ Example:’ Text1.Text = GetHtmlPageSource(“http://www.vb2themax.com/Default.asp”)Function GetHtmlPageSource(ByVal URL As String) Dim objHTTP As New XMLHTTP
When you use a COM or COM+ from a .NET application and then you set the object reference to Nothing (or let it go out of scope), the object isn’t
SQL Server’s views are updateable, but it is possible that when you insert a new record or update an existing record, the record added or modified doesn’t logical belog to