Rosetta Code

User:Klever: Difference between revisions

User page Discussion

User:Klever (view source)

Revision as of 14:33, 23 November 2011

12,269 bytes added ,  12 years ago
m
→‎KWIC index
 
(20 intermediate revisions by the same user not shown)
Line 1:
{{mylangbegin}}
{{mylang|Visual BasicVBA|Active (in VB for Applications)}}
{{mylang|BASIC|Somewhat Rusty}}
{{mylang|Fortran|Stuck in Fortran 77, WATFOR, WATFIV etc.}}
Line 12:
 
=VBA Examples=
Some nontrivial VBA Examples (untilto therebe is a separate VBA categorymoved).
 
In MS Office program (Word, Excel, Access...): open the Visual Basic window. Paste the code in a module. Execute it by typing a suitable command in the Immediate Window. Output will be directed to the Immediate Window unless stated otherwise...
 
==[[SudokuDijkstra algorithm]]==
<lang vb>
This is a version of the "brute force" approach as in the Fortran program
'Dijkstra globals
Const MaxGraph As Integer = 100 'max. number of nodes in graph
Const Infinity = 1E+308
Dim E(1 To MaxGraph, 1 To MaxGraph) As Double 'the edge costs (Infinity if no edge)
Dim A(1 To MaxGraph) As Double 'the distances calculated
Dim P(1 To MaxGraph) As Integer 'the previous/path array
Dim Q(1 To MaxGraph) As Boolean 'the queue
Public Sub Dijkstra(n, start)
'simple implementation of Dijkstra's algorithm
'n = number of nodes in graph
'start = index of start node
'init distances A
For j = 1 To n
A(j) = Infinity
Next j
A(start) = 0
'init P (path) to "no paths" and Q = set of all nodes
For j = 1 To n
Q(j) = True
P(j) = 0
Next j
Do While True 'loop will exit! (see below)
'find node u in Q with smallest distance to start
dist = Infinity
For i = 1 To n
If Q(i) Then
If A(i) < dist Then
dist = A(i)
u = i
End If
End If
Next i
If dist = Infinity Then Exit Do 'no more nodes available - done!
'remove u from Q
Q(u) = False
'loop over neighbors of u that are in Q
For j = 1 To n
If Q(j) And E(u, j) <> Infinity Then
'check if path to neighbor j via u is shorter than current estimated distance to j
alt = A(u) + E(u, j)
If alt < A(j) Then
'yes, replace with new distance and remember "previous" hop on the path
A(j) = alt
P(j) = u
End If
End If
Next j
Loop
End Sub
Public Function GetPath(source, target) As String
'reconstruct shortest path from source to target
'by working backwards from target using the P(revious) array
Dim path As String
If P(target) = 0 Then
GetPath = "No path"
Else
path = ""
u = target
Do While P(u) > 0
path = Format$(u) & " " & path
u = P(u)
Loop
GetPath = Format$(source) & " " & path
End If
End Function
Public Sub DijkstraTest()
'main function to solve Dijkstra's algorithm and return shortest path between
'a node and every other node in a digraph
' define problem:
' number of nodes
n = 5
' reset connection/cost per edge
For i = 1 To n
For j = 1 To n
E(i, j) = Infinity
Next j
P(i) = 0
Next i
' fill in the edge costs
E(1, 2) = 10
E(1, 3) = 50
E(1, 4) = 65
E(2, 3) = 30
E(2, 5) = 4
E(3, 4) = 20
E(3, 5) = 44
E(4, 2) = 70
E(4, 5) = 23
E(5, 1) = 6
'Solve it for every node
 
For v = 1 To n
<lang>
Dijkstra n, v
'Print solution
Debug.Print "From", "To", "Cost", "Path"
For j = 1 To n
If v <> j Then Debug.Print v, j, IIf(A(j) = Infinity, "---", A(j)), GetPath(v, j)
Next j
Debug.Print
Next v
End Sub
</lang>
 
Output (using the same graph as in the Floyd-Warshall algorithm below):
Dim grid(9, 9)
<pre>
Dim gridSolved(9, 9)
DijkstraTest
From To Cost Path
1 2 10 1 2
1 3 40 1 2 3
1 4 60 1 2 3 4
1 5 14 1 2 5
 
From To Cost Path
Public Sub Solve(i, j)
2 1 10 2 5 1
If i > 9 Then
2 3 30 2 3
'exit with gridSolved = Grid
2 4 50 2 3 4
For r = 1 To 9
2 For c = 1 To 9 5 4 2 5
gridSolved(r, c) = grid(r, c)
Next c
Next r
Exit Sub
End If
For n = 1 To 9
If isSafe(i, j, n) Then
nTmp = grid(i, j)
grid(i, j) = n
If j = 9 Then
Solve i + 1, 1
Else
Solve i, j + 1
End If
grid(i, j) = nTmp
End If
Next n
End Sub
 
From To Cost Path
Public Function isSafe(i, j, n) As Boolean
3 1 49 3 4 5 1
Dim iMin As Integer
3 2 59 3 4 5 1 2
Dim jMin As Integer
3 4 20 3 4
3 5 43 3 4 5
 
From To Cost Path
If grid(i, j) <> 0 Then
4 1 29 4 5 1
isSafe = (grid(i, j) = n)
4 2 39 4 5 1 2
Exit Function
4 3 69 4 5 1 2 3
End If
4 5 23 4 5
 
From To Cost Path
'grid(i,j) is an empty cell. Check if n is OK
5 1 6 5 1
'first check the row i
5 2 16 5 1 2
For c = 1 To 9
5 3 46 5 1 2 3
If grid(i, c) = n Then
5 4 66 5 1 2 3 4
isSafe = False
</pre>
Exit Function
End If
Next c
 
==[[Floyd-Warshall algorithm]]==
'now check the column j
[[File:FloydGraph.png|thumb|250px|Graph used in this and Dijkstra's algorithm]]
For r = 1 To 9
The [http://en.wikipedia.org/wiki/Floyd-Warshall_algorithm Floyd algorithm or Floyd-Warshall algorithm] finds the shortest path between all pairs of nodes in a weighted, directed graph. It is an example of dynamic programming.
If grid(r, j) = n Then
isSafe = False
Exit Function
End If
Next r
 
Usage: fill in the number of nodes (n) and the edge distances or costs in sub Floyd or in sub FloydWithPaths.
'finally, check the 3x3 subsquare containing grid(i,j)
Then run "Floyd" or "FloydWithPaths".
iMin = 1 + 3 * Int((i - 1) / 3)
jMin = 1 + 3 * Int((j - 1) / 3)
For r = iMin To iMin + 2
For c = jMin To jMin + 2
If grid(r, c) = n Then
isSafe = False
Exit Function
End If
Next c
Next r
 
Floyd: this sub prints the lengths or costs of the shortest paths but not the paths themselves
'all tests were OK
isSafe = True
End Function
 
FloydWithPaths: this sub prints the lengths and the nodes along the paths
Public Sub Sudoku()
'main routine
'to use, fill in the grid and
'type "Sudoku" in the Immediate panel of the Visual Basic for Applications window
 
<lang vb>
Dim s(9) As String
Option Compare Database
 
'Floyd globals
'initialise grid using 9 strings,one per row
Const MaxGraph As Integer = 100 'max. number of vertices in graph
s(1) = "001005070"
Const Infinity = 1E+308
s(2) = "920600000"
Dim E(1 To MaxGraph, 1 To MaxGraph) As Double
s(3) = "008000600"
Dim A(1 To MaxGraph, 1 To MaxGraph) As Double
s(4) = "090020401"
Dim Nxt(1 To MaxGraph, 1 To MaxGraph) As Integer
s(5) = "000000000"
s(6) = "304080090"
Public Sub SolveFloyd(n)
s(7) = "007000300"
'Floyd's algorithm: all-pairs shortest-paths cost
s(8) = "000007069"
'returns the cost (distance) of the least-cost (shortest) path
s(9) = "010800700"
'between all pairs in a labeled directed graph
For i = 1 To 9
'note: this sub returns only the costs, not the paths!
For j = 1 To 9
'
grid(i, j) = Int(Val(Mid$(s(i), j, 1)))
'inputs:
' n : number of vertices (maximum value is maxGraph)
' E(i,j) : cost (length,...) of edge from i to j or "Infinity" if no edge between i and j
'output:
' A(i,j): minimal cost for path from i to j
'constant:
' Infinity : very large number
For i = 1 To n
For j = 1 To n
If E(i, j) <> Infinity Then A(i, j) = E(i, j) Else A(i, j) = Infinity
Next j
A(i, i) = 0
Next i
For k = 1 To n
'solve it!
Solve 1, For i = 1 To n
For j = 1 To n
'print solution
If A(i, k) + A(k, j) < A(i, j) Then A(i, j) = A(i, k) + A(k, j)
Debug.Print "Solution:"
For i = 1 ToNext 9j
ForNext j = 1 To 9i
Next k
Debug.Print Format$(gridSolved(i, j)); " ";
End Sub
Public Sub SolveFloydWithPaths(n)
'cf. SolveFloyd, but here we
'use matrix "Nxt" to store information about paths
For i = 1 To n
For j = 1 To n
If E(i, j) <> Infinity Then A(i, j) = E(i, j) Else A(i, j) = Infinity
Next j
Debug.PrintA(i, i) = 0
Next i
For k = 1 To n
For i = 1 To n
For j = 1 To n
If A(i, k) + A(k, j) < A(i, j) Then
A(i, j) = A(i, k) + A(k, j)
Nxt(i, j) = k
End If
Next j
Next i
Next k
End Sub
</lang>
Public Function GetPath(i, j) As String
'recursively reconstruct shortest path from i to j using A and Nxt
If A(i, j) = Infinity Then
GetPath = "No path!"
Else
tmp = Nxt(i, j)
If tmp = 0 Then
GetPath = " " 'there is an edge from i to j
Else
GetPath = GetPath(i, tmp) & Format$(tmp) & GetPath(tmp, j)
End If
End If
End Function
Public Sub Floyd()
'main function to apply Floyd's algorithm
'see description in wp:en:Floyd-Warshall algorithm
' define problem:
' number of vertices?
n = 5
' reset connection/cost per edge matrix
For i = 1 To n
For j = 1 To n
E(i, j) = Infinity
Next j
Next i
' fill in the edge costs
E(1, 2) = 10
E(1, 3) = 50
E(1, 4) = 65
E(2, 3) = 30
E(2, 5) = 4
E(3, 4) = 20
E(3, 5) = 44
E(4, 2) = 70
E(4, 5) = 23
E(5, 1) = 6
'Solve it
SolveFloyd n
'Print solution
'note: for large graphs the output may be too large for the Immediate panel
'in that case you could send the output to a text file
Debug.Print "From", "To", "Cost"
For i = 1 To n
For j = 1 To n
If i <> j Then Debug.Print i, j, IIf(A(i, j) = Infinity, "No path!", A(i, j))
Next j
Next i
End Sub
Public Sub FloydWithPaths()
'main function to solve Floyd's algorithm and return shortest path between
'any two vertices
' define problem:
' number of vertices?
n = 5
' reset connection/cost per edge matrix
For i = 1 To n
For j = 1 To n
E(i, j) = Infinity
Nxt(i, j) = 0
Next j
Next i
' fill in the edge costs
E(1, 2) = 10
E(1, 3) = 50
E(1, 4) = 65
E(2, 3) = 30
E(2, 5) = 4
E(3, 4) = 20
E(3, 5) = 44
E(4, 2) = 70
E(4, 5) = 23
E(5, 1) = 6
'Solve it
SolveFloydWithPaths n
'Print solution
'note: for large graphs the output may be too large for the Immediate panel
'in that case you could send the output to a text file
Debug.Print "From", "To", "Cost", "Via"
For i = 1 To n
For j = 1 To n
If i <> j Then Debug.Print i, j, IIf(A(i, j) = Infinity, "---", A(i, j)), GetPath(i, j)
Next j
Next i
End Sub
</lang>
 
Output:
<pre>Floyd
From To Cost
1 2 10
1 3 40
1 4 60
1 5 14
2 1 10
2 3 30
2 4 50
2 5 4
3 1 49
3 2 59
3 4 20
3 5 43
4 1 29
4 2 39
4 3 69
4 5 23
5 1 6
5 2 16
5 3 46
5 4 66
 
FloydWithPaths
<pre>
From To Cost Via
Sudoku
1 2 10
Solution:
1 3 40 2
6 3 1 2 4 5 9 7 8
9 1 2 5 6 7 8 1 4 60 2 3
4 1 7 8 3 1 9 6 5 14 2
2 1 10 5
7 9 6 5 2 3 4 8 1
1 2 8 2 9 6 4 5 3 7 30
2 4 50 3
3 5 4 7 8 1 2 9 6
2 5 4
8 6 7 4 9 2 3 1 5
3 1 49 4 5
2 4 3 1 5 7 8 6 9
3 2 59 4 5 1
5 1 9 8 3 6 7 2 4
3 4 20
3 5 43 4
4 1 29 5
4 2 39 5 1
4 3 69 5 1 2
4 5 23
5 1 6
5 2 16 1
5 3 46 1 2
5 4 66 1 2 3
</pre>
 
==[[KWIC index]]==
 
<lang vb>
==[[Greatest element of a list]]==
'KWIC index
<lang>
'assumptions:
Public Function ListMax(anArray())
' - all titles and catalog numbers can be held in an array in main memory
'return the greatest element in array anArray whose length is unknown to this function
' - disregard punctuation in titles
n0 = LBound(anArray)
' - the KWIC index itself may be too large for main memory - do not store it in memory
n = UBound(anArray)
' - the KWIC index consists of one line per title/keyword combination and consists of:
theMax = anArray(n0)
' - the catalog number
For i = (n0 + 1) To n
' - the title with the keyword centered in a line of given length (e.g. 80 or 120)
If anArray(i) > theMax Then theMax = anArray(i)
' (constant-width font assumed)
Next
' note: long titles may be truncated at the beginning or the end of the line
ListMax = theMax
End Function
 
'globals
Const MAXKEYS = 20 'max. number of keywords in a title
Const STOPWORDS = "a an and by for is it of on or the to with " 'that last space is needed!
Dim title() As String 'list of titles to be included in KWIC index
Dim catno() As Integer 'list of catalog numbers
Dim ntitle As Integer 'number of titles
Dim index() As Integer 'holds title number and position of keyword in title
Dim nkeys As Long 'total number of keywords found
 
Public Sub ListMaxTestReadTitles()
' read or - in this case - set the titles and catalog numbers
Dim b()
ntitle = 10
'test function ListMax
ReDim title(1 To ntitle)
'fill array b with some numbers:
ReDim catno(1 To ntitle)
b = Array(5992424433449#, 4534344439984#, 551344678, 99800000#)
title(1) = "Microsoft Visio 2003 User's Guide"
'print the greatest element
title(2) = "Microsoft Office Excel 2003 Inside Out"
Debug.Print "Greatest element is"; ListMax(b())
title(3) = "Mastering Excel 2003 Programming with VBA"
title(4) = "Excel 2003 Formulas"
title(5) = "Excel for Scientists and Engineers"
title(6) = "Excel 2003 VBA Programmer's Reference"
title(7) = "Automated Data Analysis Using Excel"
title(8) = "Beginning Excel: What-if Data Analysis Tools"
title(9) = "How to do Everything with Microsoft Office Excel 2003"
title(10) = "Data Analysis Using SQL and Excel"
catno(1) = 10
catno(2) = 13
catno(3) = 3435
catno(4) = 987
catno(5) = 1010
catno(6) = 1244
catno(7) = 709
catno(8) = 9088
catno(9) = 33
catno(10) = 7733
End Sub
</lang>
 
Function IsStopword(aword) As Boolean
Result:
'search for aword in stopword list
<pre>
'add an extra space to avoid ambiguity
ListMaxTest
IsStopword = InStr(STOPWORDS, LCase(aword) & " ") > 0
Greatest element is 5992424433449
</pre>
 
==[[Reverse a string]]==
===Non-recursive version===
<lang>
Public Function Reverse(aString as String) as String
' returns the reversed string
dim L as integer 'length of string
dim newString as string
 
newString = ""
L = len(aString)
for i = L to 1 step -1
newString = newString & mid$(aString, i, 1)
next
Reverse = newString
End Function
</lang>
 
Sub ProcessTitles()
===Recursive version===
'find positions of keywords in titles, store in index array
<lang>
'Note: we cannot use Split here because that function doesn't return
Public Function RReverse(aString As String) As String
'the positions of the words it finds
'returns the reversed string
nkeys = 0
'do it recursively: cut the sring in two, reverse these fragments and put them back together in reverse order
For i = 1 To ntitle
Dim L As Integer 'length of string
atitle = title(i) & " " 'add extra space as sentinel
Dim M As Integer 'cut point
p1 = 1
Do While p1 <= Len(atitle)
'find next word:
'a) find next non-space
While Mid$(atitle, p1, 1) = " ": p1 = p1 + 1: Wend
'b) extend word
p2 = p1
While Mid$(atitle, p2, 1) <> " ": p2 = p2 + 1: Wend
aword = Mid$(atitle, p1, p2 - p1)
'for now we assume there is no punctuation, i.e. no words
'in parentheses, brackets or quotation marks
If Not IsStopword(aword) Then
'remember position of this keyword
'we probably should check for overflow (too many keywords) here!
nkeys = nkeys + 1
index(nkeys, 1) = i
index(nkeys, 2) = p1
End If
'continue searching
p1 = p2 + 1
Loop
Next i
End Sub
 
LFunction = LenShift(aString, pos)
'return shifted string (part beginning at position "pos" followed by part before it)
If L <= 1 Then 'no need to reverse
Shift = Mid$(aString, pos) & " " & Left$(aString, pos - 1)
RReverse = aString
Else
M = Int(L / 2)
RReverse = RReverse(Right$(aString, L - M)) & RReverse(Left$(aString, M))
End If
End Function
</lang>
 
===Example dialogue===
<pre>
print Reverse("Public Function Reverse(aString As String) As String")
gnirtS sA )gnirtS sA gnirtSa(esreveR noitcnuF cilbuP
 
print RReverse("Sunday Monday Tuesday Wednesday Thursday Friday Saturday Love")
evoL yadrutaS yadirF yadsruhT yadsendeW yadseuT yadnoM yadnuS
 
print RReverse(Reverse("I know what you did last summer"))
I know what you did last summer
</pre>
 
Sub SortTitles()
==[[Ordered words]]==
' sort the index() array to represent shifted titles in alphabetical order
<lang>
' more efficient sorting algorithms can be applied here...
Public Sub orderedwords(fname As String)
switched = True
' find ordered words in dict file that have the longest word length
Do While switched
' fname is the name of the input file
'scan array for two shifted strings in the wrong order and swap
' the words are printed in the immediate window
'(swap the index entries, not the strings)
' this subroutine uses boolean function IsOrdered
'use case-insensitive compare
switched = False
Dim word As String 'word to be tested
For i = 1 To nkeys - 1
Dim l As Integer 'length of word
string1 = LCase(Shift(title(index(i, 1)), index(i, 2)))
Dim wordlength As Integer 'current longest word length
string2 = LCase(Shift(title(index(i + 1, 1)), index(i + 1, 2)))
Dim orderedword() As String 'dynamic array holding the ordered words with the current longest word length
If string2 < string1 Then 'swap
Dim wordsfound As Integer 'length of the array orderedword()
For j = 1 To 2
 
temp = index(i, j)
On Error GoTo NotFound 'catch incorrect/missing file name
index(i, j) = index(i + 1, j)
Open fname For Input As #1
index(i + 1, j) = temp
On Error GoTo 0
Next
 
switched = True
'initialize
wordsfound = 0
wordlength = 0
 
'process file line per line
While Not EOF(1)
Line Input #1, word
If IsOrdered(word) Then 'found one, is it equal to or longer than current word length?
l = Len(word)
If l >= wordlength Then 'yes, so add to list or start a new list
If l > wordlength Then 'it's longer, we must start a new list
wordsfound = 1
wordlength = l
Else 'equal length, increase the list size
wordsfound = wordsfound + 1
End If
Next i
'add the word to the list
Loop
ReDim Preserve orderedword(wordsfound)
End Sub
orderedword(wordsfound) = word
End If
End If
Wend
Close #1
 
'print the list
Debug.Print "Found"; wordsfound; "ordered words of length"; wordlength
For i = 1 To wordsfound
Debug.Print orderedword(i)
Next
Exit Sub
 
Sub PrintKWIC(linelength)
NotFound:
'print the KWIC index
debug.print "Error: Cannot find or open file """ & fname & """!"
spaces = Space(linelength / 2)
Debug.Print "Cat. number", "|"; Space((linelength - 10) / 2); "KWIC string"
Debug.Print String(linelength + 15, "-")
For i = 1 To nkeys
atitle = title(index(i, 1))
pos = index(i, 2)
'create shifted string so that keyword is centered in the line
part2 = Mid$(atitle, pos)
part1 = Right$(spaces & Left$(atitle, pos - 1), linelength / 2)
kwicstring = Right$(part1, linelength / 2) & Left$(part2, linelength / 2)
Debug.Print catno(index(i, 1)), "|"; kwicstring
Next
End Sub
 
Sub KWIC()
 
'main program for KWIC index
 
ReadTitles
Public Function IsOrdered(someWord As String) As Boolean
'set array
'true if letters in word are in ascending (ascii) sequence
ReDim index(ntitle * MAXKEYS, 2)
 
'index(.,1) is title nr.
Dim l As Integer 'length of someWord
'index(.,2) is keyword position in title
Dim wordLcase As String 'the word in lower case
ProcessTitles
Dim ascStart As Integer 'ascii code of first char
SortTitles
Dim asc2 As Integer 'ascii code of next char
PrintKWIC 80 'argument is the length of the KWIC lines (excluding catalog numbers)
 
End Sub
wordLcase = LCase(someWord) 'convert to lower case
l = Len(someWord)
IsOrdered = True
If l > 0 Then 'this skips empty string - it is considered ordered...
ascStart = Asc(Left$(wordLcase, 1))
For i = 2 To l
asc2 = Asc(Mid$(wordLcase, i, 1))
If asc2 < ascStart Then 'failure!
IsOrdered = False
Exit Function
End If
ascStart = asc2
Next i
End If
End Function
</lang>
 
Output (note that some titles are truncated at the start or the end. An improvement could be to wrap these titles around if there is room on the other end):
Results:
<pre>
kwic
OrderedWords("unixdict.txt")
Cat. number | KWIC string
Found 16 ordered words of length 6
-----------------------------------------------------------------------------------------------
abbott
987 | Excel 2003 Formulas
accent
33 | Everything with Microsoft Office Excel 2003
accept
13 | Microsoft Office Excel 2003 Inside Out
access
3435 | Mastering Excel 2003 Programming with VBA
accost
10 | Microsoft Visio 2003 User's Guide
almost
1244 | Excel 2003 VBA Programmer's Reference
bellow
9088 | Beginning Excel: What-if Data Analysis Tools
billow
709 | Automated Data Analysis Using Excel
biopsy
7733 | Data Analysis Using SQL and Excel
chilly
709 | Automated Data Analysis Using Excel
choosy
9088 | Beginning Excel: What-if Data Analysis T
choppy
9088 | Beginning Excel: What-if Data Analysis Tools
effort
709 | Automated Data Analysis Using Excel
floppy
7733 | Data Analysis Using SQL and Excel
glossy
33 | How to do Everything with Microsoft Office Exce
knotty
1010 | Excel for Scientists and Engineers
33 | How to do Everything with Microsoft Office Excel 2
987 | Excel 2003 Formulas
33 | to do Everything with Microsoft Office Excel 2003
13 | Microsoft Office Excel 2003 Inside Out
3435 | Mastering Excel 2003 Programming with VBA
1244 | Excel 2003 VBA Programmer's Reference
709 | Automated Data Analysis Using Excel
7733 | Data Analysis Using SQL and Excel
1010 | Excel for Scientists and Engineers
9088 | Beginning Excel: What-if Data Analysis Tools
987 | Excel 2003 Formulas
10 | Microsoft Visio 2003 User's Guide
33 | How to do Everything with Microsoft Offi
13 | Microsoft Office Excel 2003 Inside Out
3435 | Mastering Excel 2003 Programming with VB
33 | How to do Everything with Microsoft Office Excel 2003
13 | Microsoft Office Excel 2003 Inside Out
10 | Microsoft Visio 2003 User's Guide
33 | How to do Everything with Microsoft Office Excel 2003
13 | Microsoft Office Excel 2003 Inside Out
13 | Microsoft Office Excel 2003 Inside Out
1244 | Excel 2003 VBA Programmer's Reference
3435 | Mastering Excel 2003 Programming with VBA
1244 | Excel 2003 VBA Programmer's Reference
1010 | Excel for Scientists and Engineers
7733 | Data Analysis Using SQL and Excel
9088 | Beginning Excel: What-if Data Analysis Tools
10 | Microsoft Visio 2003 User's Guide
709 | Automated Data Analysis Using Excel
7733 | Data Analysis Using SQL and Excel
3435 | Mastering Excel 2003 Programming with VBA
1244 | Excel 2003 VBA Programmer's Reference
10 | Microsoft Visio 2003 User's Guide
9088 | Beginning Excel: What-if Data Analysis Tools
</pre>
 
Anonymous user
Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/201597...201618"