Added Info BYTE May 1977 (v.2#5) pg. 142
Basic sorts. Two simple BASIC programs are able to arrange a series of numbers into ascending order or a list of words into alphabetical order.
BYTE Apr 1978 (v.3#4) pg. 148
An improved sort routine called "straight insertion". Written in BASIC.
BYTE Jul 1978 (v.3#7) pg. 121
A similarity comparator for strings is written in Ohio Scientific Instruments 8K BASIC ( a Microsoft interpreter). This routine will enable a computer to find a "close" match for the desired string as well as an "exact" match.
BYTE Sep 1979 (v.4#9) pg. 58
Tracing your own roots. How to do genealogical research with the aid of a microcomputer to store and manipulate information about your ancestors. Includes source listing of a storage program written in BASIC Plus 2 (Digital Equipment Co.).
BYTE Oct 1979 (v.4#10) pg. 22
Easy to use hashing (or scatter storage) function for implementation on a 6800 microprocessor. Compares hashing with other sorting and searching techniques.
BYTE Oct 1979 (v.4#10) pg. 200
Similarity (string comparator) program written in North Star BASIC.
BYTE Feb 1980 (v.5#2) pg. 86
Implementing dynamic data structures with BASIC files. Using linked lists to maintain sorted files.
BYTE Feb 1980 (v.5#2) pg. 92
Program in Microsoft BASIC for the Commodore PET uses the SOUNDEX code to retrieve personal names with the same pronunciation, but different spellings.
BYTE May 1980 (v.5#5) pg. 196
Understanding ISAM (indexed sequential access method).
BYTE Jun 1980 (v.5#6) pg. 108
Sorting with a catch. Modification of the bubble sort technique works well with a list already nearly in alphabetical order.
BYTE Sep 1980 (v.5#9) pg. 323
Sorting with binary trees. Data-storage structure which makes it easy to insert or delete items in the file.
BYTE Oct 1980 (v.5#10) pg. 96
Added Info BYTE Feb 1981 (v.6#2) pg. 22, 24
An information retrieval system. How the programs operate to maintain a file of related records and print selective lists based on a given criteria is illustrated. The FORTRAN programs are available for a TRS-80.
BYTE Oct 1980 (v.5#10) pg. 114
Tree searching. Part 1. Basic techniques. Includes search programs written in BASIC.
BYTE Sep 1981 (v.6#9) pg. 72
Correction BYTE Jun 1982 (v.7#6) pg. 480
Correction BYTE Jan 1983 (v.8#1) pg. 391
Tree searching. Part 2. Heuristic techniques.
BYTE Oct 1981 (v.6#10) pg. 195
Correction BYTE Jan 1983 (v.8#1) pg. 391
Writing with a data-base management system.
BYTE Nov 1981 (v.6#11) pg. 18
Fundamentals of relational data organization. How to apply a set of mathematical principles to the organization of a data base.
BYTE Nov 1981 (v.6#11) pg. 48
Data-base management systems: Powerful newcomers to microcomputers. A brief introduction.
BYTE Nov 1981 (v.6#11) pg. 97
DIF: a format for data exchange between application programs.
BYTE Nov 1981 (v.6#11) pg. 174
PDQ Key-File System, a data-management system for beginners. Written in BASIC for a TRS-80 Model III. May be adapted to other systems using Microsoft BASIC.
BYTE Nov 1981 (v.6#11) pg. 236
Finding words that sound alike. The Soundex algorithm. Written in Applesoft BASIC, this program accepts a character string, converts it to the Soundex code, and prints out all words that have the same code string.
BYTE Mar 1982 (v.7#3) pg. 473
Microcomputers in cultural anthropology. APL programs for analysis and management of qualitative data (texts) generated by anthropologists working in the field.
BYTE Jul 1982 (v.7#7) pg. 250
A faster binary search technique.
BYTE Mar 1983 (v.8#3) pg. 262
Keywords in a fuzzy context. CBASIC programs for bibliographic search will tell you the degree to which various articles meet your requirements. Uses the "fuzzy-set" search theory.
BYTE Mar 1983 (v.8#3) pg. 389
Correction BYTE Jul 1983 (v.8#7) pg. 18
Sorting algorithms for microcomputers. Programmer ingenuity and search of the existing literature can significantly improve sort performance.
BYTE May 1983 (v.8#5) pg. 482
AVL trees. Introducing a Russian-developed scheme for searching and updating sorted data efficiently.
BYTE Jun 1983 (v.8#6) pg. 387
Data file management methods. Organize your files to eliminate confusion. Importance of good documentation and file backup are discussed.
BYTE Sep 1983 (v.8#9) pg. 376
Bitmaps speed data-handling tasks. Programming techniques employing bitmaps enhance the speed of list comparison and make short work of file searches.
BYTE Oct 1983 (v.8#10) pg. 480
Address-calculation sort program written in BASIC for the Apple II computer.
BYTE Nov 1983 (v.8#11) pg. 494
Added Info BYTE Apr 1984 (v.9#4) pg. 20
Array capabilities for dBase II.
BYTE Nov 1983 (v.8#11) pg. 552
Indexing open-ended tree structures. How to "walk" through a "grove" of A-trees in search of hierarchical nodes.
BYTE May 1984 (v.9#5) pg. 406
Added Info BYTE Sep 1984 (v.9#10) pg. 22
Data abstraction. A BASIC program illustrates abstraction techniques that let you manipulate data structures without concern for the type of data that will populate these structures.
BYTE Oct 1984 (v.9#11) pg. 130
Databases. Six articles view ways to manage and access information.
BYTE Oct 1984 (v.9#11) pg. 135
Data Access. A simple data base and information retreival program written in BASIC. Allows you to search the data base looking for variables.
COMPUTERS & PROGRAMMING Sep-Oct 1981 (v.21#5) pg. 60
MUSIC LIBRARY computer program written for SWTP 8K BASIC (version 2.0) with a Percom LFD-400 disk system. Keeps track of some 2300 songs, artists and album titles.
ELEMENTARY ELECTRONICS May-Jun 1979 (v.19#3) pg. 70
5 hours or 5 minutes. Sorting techniques are compared. Comparison of the ripple sort, bubble sort and the Shell-Metzner sort.
KILOBAUD MICROCOMPUTING #17 May 1978 pg. 100
A different search technique. How to speed up searching tables for a match. Can save as much as one-half of the search time.
KILOBAUD MICROCOMPUTING #17 May 1978 pg. 112
It's there, but where. A description of simplified data storage and retrieval techniques, and some tricks-of-the-trade. Using arrays, ragged tables, lists, and other techniques to store large amounts of complex information in limited memory space.
KILOBAUD MICROCOMPUTING #26 Feb 1979 pg. 50
Correction KILOBAUD MICROCOMPUTING #32 Aug 1979 pg. 131
BASIC program for SWTP machine will alphabetize a list of up to 99 items (such as names), number the list, and print it out after sorting. The items must be input from the keyboard at the start of the program.
KILOBAUD MICROCOMPUTING #28 Apr 1979 pg. 94
QUICKSORT. Programs illustrate the Shell sort and modified Quicksort methods for sorting N elements in an array. Table compares sorting times for 100 elements.
KILOBAUD MICROCOMPUTING #28 Apr 1979 pg. 96
Introduction to data base management.
KILOBAUD MICROCOMPUTING #29 May 1979 pg. 54
A TRS-80 cross-index. A document indexing program cites the document number, the name of the originator, the name of the recipient, and the date of the document. Information is stored on magnetic cassettes. The tapes may then be searched on the index parameters. Written in Level II BASIC.
KILOBAUD MICROCOMPUTING #29 May 1979 pg. 94
The ELECTRONIC LIBRARIAN. Ambitious program in BASIC-E is used to cross-index journals, magazine articles or other information. Uses a keyword indexing scheme allowing up to 676 different subject headings.
KILOBAUD MICROCOMPUTING #35 Nov 1979 pg. 44
An operator-oriented data base management system. Part 1. Program features and operations. Features include (1) Up to 30 fields. (2) 248 char. records. (3) Editing. (4) Sorting. (5) Searching. and more.
KILOBAUD MICROCOMPUTING #37 Jan 1980 pg. 84
An operator-oriented data base management system. Part 2. Programs written in Micropolis version 4.0 BASIC. Listings given for programs to CREATE, MAINTAIN, and DELETE data files.
KILOBAUD MICROCOMPUTING #38 Feb 1980 pg. 36
An operator-oriented data base management system. Part 3. Programs to sort and print the data.
KILOBAUD MICROCOMPUTING #39 Mar 1980 pg. 84
DATBAS. A simple data base management system written in BASIC. Part 1. System requirements and the first program, SCREEN. SCREEN specifies record layout and formats an input screen with prompts.
KILOBAUD MICROCOMPUTING #40 Apr 1980 pg. 88
DATBAS. Part 2. FILEIT program allows creation of a new data base or modification of an existing data base. Also has a routine for squeezing blank records out of the data base.
KILOBAUD MICROCOMPUTING #41 May 1980 pg. 180
File sorting program. Part 1. Written in BASIC for the Apple II. Strategies for sorting, writing the sort program, and getting sort parameters from the user into the program.
KILOBAUD MICROCOMPUTING #42 Jun 1980 pg. 34
File sorting program. Part 2. Completing the sorting program and more information about Apple DOS.
KILOBAUD MICROCOMPUTING #43 Jul 1980 pg. 44
DATBAS. Part 3. SORTIT. A multikeyed program designed to sort files generated by FILEIT. Written in Microworks Business BASIC. Supports up to five levels of sort, in either ascending or descending order.
KILOBAUD MICROCOMPUTING #43 Jul 1980 pg. 120
Correction KILOBAUD MICROCOMPUTING #45 Sep 1980 pg. 210
Reader-service reply: A record keeping system. Helps a magazine reader remember what information he has already requested when using a previous reader-service reply card.
KILOBAUD MICROCOMPUTING #43 Jul 1980 pg. 160
Matrix sorting. A technique for multiple data sorts. Written in TRS-80 Level II BASIC.
KILOBAUD MICROCOMPUTING #43 Jul 1980 pg. 174
FASTFIND. A BASIC program designed to search large arrays looking for a variable which matches a given value.
KILOBAUD MICROCOMPUTING #44 Aug 1980 pg. 182
Reduce search time with an index. How to speed up BASIC program searches of data files by creating an index pointer to a pre-sorted file.
KILOBAUD MICROCOMPUTING #46 Oct 1980 pg. 162
Wine-log program written in SWTP BASIC. Record keeping program for an amateur winemaker uses a home computer.
KILOBAUD MICROCOMPUTING #48 Dec 1980 pg. 104
Database manager for the North Star computer. Written in BASIC.
KILOBAUD MICROCOMPUTING #51 Mar 1981 (v.5#3) pg. 86
The ultimate information juggler. Data base management program written in BASIC for a SWTP computer.
KILOBAUD MICROCOMPUTING #52 Apr 1981 (v.5#4) pg. 133
A better bubble sort. Find out how bidirectionality can make this simple sorting method more efficient.
KILOBAUD MICROCOMPUTING #52 Apr 1981 (v.5#4) pg. 148
Correction KILOBAUD MICROCOMPUTING #54 Jun 1981 (v.5#6) pg. 212
Correction KILOBAUD MICROCOMPUTING #55 Jul 1981 (v.5#7) pg. 215
8080 assembly-language Shell-Metzner sort will sort 32K in one minute. Use with any BASIC that supports external routines and has a POKE or similar function.
KILOBAUD MICROCOMPUTING #52 Apr 1981 (v.5#4) pg. 164
The wonderful world of data structures. How data is organized, manipulated and stored in memory.
KILOBAUD MICROCOMPUTING #54 Jun 1981 (v.5#6) pg. 84
Use a computer and the method of finite differences (difference calculus) to spot and correct incorrect data. Includes a difference calculus program applied to wind-chill data.
KILOBAUD MICROCOMPUTING #56 Aug 1981 (v.5#8) pg. 152
Special issue on communications and microcomputers including a review of available on-line data bases and information services.
KILOBAUD MICROCOMPUTING #58 Oct 1981 (v.5#10) pg. 42+
Interactive mapping/inquiry facility locates information within a database system. Written in North Star BASIC.
KILOBAUD MICROCOMPUTING #58 Oct 1981 (v.5#10) pg. 206
Computer program written in BASIC is used by people who tape phonograph records to "balance the timing" of the tape (fit as much on a tape as possible with no wasted space). Prints a list of selections recorded.
KILOBAUD MICROCOMPUTING #59 Nov 1981 (v.5#11) pg. 146
Sorting techniques explained. Bubble vs. straight insertion vs. quicksort. When and why to use each type.
KILOBAUD MICROCOMPUTING #59 Nov 1981 (v.5#11) pg. 156
Correction MICROCOMPUTING Apr 1982 (v.6#4) pg. 26
The lazy man's DBM. A simple list-maintenance system written in BASIC.
KILOBAUD MICROCOMPUTING Feb 1982 (v.6#2) pg. 118
Quick and dirty information retrieval system (QADIRS) is implemented using any line editor that has the global find function. The concept is similar to the KWIC index (key word in context).
MICROCOMPUTING May 1982 (v.6#5) pg. 64
Word Unscrambler program. A BASIC computer program that will list all possible permutations of the word given as input.
MICROCOMPUTING Jul 1982 (v.6#7) pg. 37
SCRAZZLE program for the IBM Personal Computer prints out all the possible combinations of letters which compose a given input word.
MICROCOMPUTING Oct 1982 (v.6#10) pg. 13
Information storage and retrieval program for the Apple II is written in BASIC.
MICROCOMPUTING Oct 1982 (v.6#10) pg. 60
How to sort record lists using the pop-up bubble sort with sinkers routine.
MICROCOMPUTING Oct 1982 (v.6#10) pg. 68
Applesoft BASIC "Bookshelf Database" program lets you keep track of the books in your personal library according to author, title, publisher, etc.
MICROCOMPUTING Nov 1982 (v.6#11) pg. 69
Added Info MICROCOMPUTING #74 Feb 1983 (v.7#2) pg. 138
Added Info MICROCOMPUTING #80 Aug 1983 (v.7#8) pg. 120
Librarian program in IBM PC Basic. Use random files to locate books in a home library.
MICROCOMPUTING Dec 1982 (v.6#12) pg. 48
Correction MICROCOMPUTING #75 Mar 1983 (v.7#3) pg. 32
Sort utility program handles records up to 2550 bytes and keys up to 255 bytes.
MICROCOMPUTING #83 Nov 1983 (v.7#11) pg. 56
Sort demonstration program written in BASIC illustrates how three different sorting methods (bubble sort, quicksort, and fastsort) operate.
MICROCOMPUTING #83 Nov 1983 (v.7#11) pg. 85
Program to convert dBASE.DBF files to MAILMERGE.TXT files.
MICROCOMPUTING #84 Dec 1983 (v.7#12) pg. 26
A versatile Z-80 assembly language sorting routine that is designed specifically for BASIC users. It is based on the Shell-Metzner sort algorithm.
MICROCOMPUTING #85 Jan 1984 (v.8#1) pg. 104
Truth table searching techniques. Looks at the linear search, ordered search, hashing, and the binary chop.
MICROCOMPUTING #87 Mar 1984 (v.8#3) pg. 100
How to simulate arrays when using dBase II programing language.
MICROCOMPUTING #89 May 1984 (v.8#5) pg. 50
Weavcat I on the Apple. A BASIC program for cataloging periodical articles. Written for use on Apple II Plus (48K) or Apple II with Applesoft in ROM.
WEAVER'S JOURNAL #26 Fall 1982 (v.7#2) pg. 68