NotesFAQContact Us
Collection
Advanced
Search Tips
Showing all 3 results Save | Export
Peer reviewed Peer reviewed
Maier, Bruce – School Science and Mathematics, 1972
Descriptors: Algorithms, Computer Oriented Programs, Computer Programs, Geometric Concepts
Peer reviewed Peer reviewed
Duncan, David R.; Litwiller, Bonnie H. – School Science and Mathematics, 1984
Describes eight increasingly sophisticated and efficient sorting algorithms including linear insertion, binary insertion, shellsort, bubble exchange, shakersort, quick sort, straight selection, and tree selection. Provides challenges for the reader and the student to program these efficiently. (JM)
Descriptors: Algorithms, Classification, College Mathematics, High Schools
Peer reviewed Peer reviewed
Aslan, Farhad; Duck, Howard – School Science and Mathematics, 1992
P-adic or g-adic sets are sets of elements formed by linear combinations of powers of p, a prime number, or g, a counting number, where the coefficients are whole numbers less than p or g. Discusses exercises illustrating basic numerical operations for p-adic and g-adic sets. Provides BASIC computer programs to verify the solutions. (MDH)
Descriptors: Addition, Algebra, Algorithms, College Mathematics