{"title":"算法研究的最新方法","authors":"S. Zweben","doi":"10.1145/1408800.1408922","DOIUrl":null,"url":null,"abstract":"Much of the past work in the study of algorithms has been done in terms of what the algorithm is intended to do, and the properties of algorithms that are studied in this connection are often, therefore, execution-related. Even when an algorithm has been studied in terms of the way it was written, terms such as block structure and control flow were commonly used, and the most basic constituent studied was the individual statement.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"138 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A recent approach to the study of algorithms\",\"authors\":\"S. Zweben\",\"doi\":\"10.1145/1408800.1408922\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Much of the past work in the study of algorithms has been done in terms of what the algorithm is intended to do, and the properties of algorithms that are studied in this connection are often, therefore, execution-related. Even when an algorithm has been studied in terms of the way it was written, terms such as block structure and control flow were commonly used, and the most basic constituent studied was the individual statement.\",\"PeriodicalId\":204185,\"journal\":{\"name\":\"ACM '74\",\"volume\":\"138 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM '74\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1408800.1408922\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM '74","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1408800.1408922","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Much of the past work in the study of algorithms has been done in terms of what the algorithm is intended to do, and the properties of algorithms that are studied in this connection are often, therefore, execution-related. Even when an algorithm has been studied in terms of the way it was written, terms such as block structure and control flow were commonly used, and the most basic constituent studied was the individual statement.