Back to Search
Start Over
Determining the Activity Series with the Fewest Experiments Using Sorting Algorithms
- Source :
- Journal of Chemical Education. 98:1653-1658
- Publication Year :
- 2021
- Publisher :
- American Chemical Society (ACS), 2021.
-
Abstract
- Determining the activity series of a collection of elements is a classic pedagogical experiment, in which pairs of elements are reacted to determine the relative rank ordering of their reactivity. Determining the optimal sequence of pairwise experiments that minimizes the total number of experiments corresponds to well-known comparison sorting algorithms in computer science. We describe relevant algorithms (insertion sort, binary insertion sort, merge sort, and merge insertion sort) and their application to the activity series problem and discuss ways that this connection can contribute to the introductory chemistry and computer science curricula. In addition to pedagogical interest, this illustrates a simple form of artificial intelligence for chemical experiment planning.
- Subjects :
- Insertion sort
Sequence
Sorting algorithm
Theoretical computer science
Series (mathematics)
010405 organic chemistry
05 social sciences
050301 education
Binary number
General Chemistry
01 natural sciences
0104 chemical sciences
Education
Data_FILES
Pairwise comparison
Merge sort
0503 education
Merge (linguistics)
Subjects
Details
- ISSN :
- 19381328 and 00219584
- Volume :
- 98
- Database :
- OpenAIRE
- Journal :
- Journal of Chemical Education
- Accession number :
- edsair.doi...........91b809af62d292fb1da67cee32841a1d