The chapter discusses the submission guidelines and policies for algorithms in the *Communications* department of the Association for Computing Machinery (ACM). Contributions must follow the format specified in the Algorithms Department Policy Statement and be written in the style of recent algorithms published in the department. The contributors, editors, and ACM do not provide any warranty for the accuracy or functionality of the algorithms. Reproduction of algorithms is permitted without charge, but proper attribution is required. A specific algorithm, the Bisection Routine, is detailed by S. Gorn from the University of Pennsylvania Computer Center. This routine evaluates a function at the endpoints of an interval and uses iterated bisection to find a root. It halts if the function value is less than a specified tolerance ε or if successive approximations differ by less than ε. The routine is applicable to any continuous function and does not require differentiability conditions, making it a reliable method for finding real roots. The chapter also includes a section on standards, where MANDALAY GREMS from IBM Data Processing Division suggests improvements to the SHARE Standard Flow Chart Symbols. He recommends a symbol for "Decision or Comparison" that is easier to draw and more intuitive, and suggests adding symbols for "Card," "Tape," and "Printed Report" to enhance the visual clarity of flowcharts.The chapter discusses the submission guidelines and policies for algorithms in the *Communications* department of the Association for Computing Machinery (ACM). Contributions must follow the format specified in the Algorithms Department Policy Statement and be written in the style of recent algorithms published in the department. The contributors, editors, and ACM do not provide any warranty for the accuracy or functionality of the algorithms. Reproduction of algorithms is permitted without charge, but proper attribution is required. A specific algorithm, the Bisection Routine, is detailed by S. Gorn from the University of Pennsylvania Computer Center. This routine evaluates a function at the endpoints of an interval and uses iterated bisection to find a root. It halts if the function value is less than a specified tolerance ε or if successive approximations differ by less than ε. The routine is applicable to any continuous function and does not require differentiability conditions, making it a reliable method for finding real roots. The chapter also includes a section on standards, where MANDALAY GREMS from IBM Data Processing Division suggests improvements to the SHARE Standard Flow Chart Symbols. He recommends a symbol for "Decision or Comparison" that is easier to draw and more intuitive, and suggests adding symbols for "Card," "Tape," and "Printed Report" to enhance the visual clarity of flowcharts.