Small programming exercises 20

DOI10.1016/0167-6423(88)90023-8zbMATH Open0632.68011OpenAlexW2018910079MaRDI QIDQ1095637

B. George

Publication date: 1988

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6423(88)90023-8

zbMATH Keywords

square recognitionmaximum productnumber of surpassers

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Related Items (2)

Small programming exercises 24 ⋮ Calculating a linear-time solution to the densest-segment problem

This page was built for publication: Small programming exercises 20

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1095637)