Contributions to the Algorithms Department must follow the Algorithms Department Policy Statement (Communications, February 1960). They should be sent to J. H. Wegstein, Computation Laboratory, National Bureau of Standards, Washington, D.C. Algorithms must be in ALGOL publication form and written in a style similar to the most recent algorithms in the department. Although contributors test their algorithms, no warranty or responsibility is assumed for their accuracy or functioning. Reproduction of algorithms is permitted without charge, but publication requires citation of the author and the Communications issue. The bisection routine, written by S. Gorn of the University of Pennsylvania Computer Center, evaluates a function at the endpoints of an interval. If no sign change is detected, it exits with an error. Otherwise, it finds a root through iterative bisection, halting when the function value is less than ε or successive approximations differ by less than ε. ε should be chosen based on function evaluation error and desired accuracy. The routine is applicable to any continuous function and is considered an "old work horse" due to its simplicity and lack of differentiability requirements. The author also discusses flowchart symbols, recommending changes to the SHARE symbols, particularly the "Decision or Comparison" symbol. He suggests symbols for "Card," "Tape," and "Printed Report," advocating for simple, memorable symbols that aid in understanding program flow rather than complex lists. Mandalay Grems, from IBM Data Processing Division, supports these changes.Contributions to the Algorithms Department must follow the Algorithms Department Policy Statement (Communications, February 1960). They should be sent to J. H. Wegstein, Computation Laboratory, National Bureau of Standards, Washington, D.C. Algorithms must be in ALGOL publication form and written in a style similar to the most recent algorithms in the department. Although contributors test their algorithms, no warranty or responsibility is assumed for their accuracy or functioning. Reproduction of algorithms is permitted without charge, but publication requires citation of the author and the Communications issue. The bisection routine, written by S. Gorn of the University of Pennsylvania Computer Center, evaluates a function at the endpoints of an interval. If no sign change is detected, it exits with an error. Otherwise, it finds a root through iterative bisection, halting when the function value is less than ε or successive approximations differ by less than ε. ε should be chosen based on function evaluation error and desired accuracy. The routine is applicable to any continuous function and is considered an "old work horse" due to its simplicity and lack of differentiability requirements. The author also discusses flowchart symbols, recommending changes to the SHARE symbols, particularly the "Decision or Comparison" symbol. He suggests symbols for "Card," "Tape," and "Printed Report," advocating for simple, memorable symbols that aid in understanding program flow rather than complex lists. Mandalay Grems, from IBM Data Processing Division, supports these changes.