分析时间和空间复杂性:最大子阵列问题的Kadane与分治算法

{"title":"分析时间和空间复杂性:最大子阵列问题的Kadane与分治算法","authors":"Wirawan ISTIONO","doi":"10.4316/jacsm.202302004","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":30102,"journal":{"name":"Journal of Applied Computer Science Mathematics","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Analyzing Time and Space Complexity: Kadane vs. Divide and Conquer Algorithms for Maximum Sub-array Problem\",\"authors\":\"Wirawan ISTIONO\",\"doi\":\"10.4316/jacsm.202302004\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":30102,\"journal\":{\"name\":\"Journal of Applied Computer Science Mathematics\",\"volume\":\"59 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Applied Computer Science Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4316/jacsm.202302004\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Applied Computer Science Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4316/jacsm.202302004","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}