Abstract
Computerized Enumeration of alkane’s isomers has long been a topic of interest to the researchers. The double bond carbon content and triple bond carbon content isomers were mostly neglected for many decades by the researchers and claimed in the literature that there is no simple algorithm for these problems. In this paper an efficient and simple algorithm has been proposed to count the number of constitutional isomers of alkynes series. By using this recursive algorithm the resulting computation of number of isomers for alkynes with any number of carbon contents [limited to system specifications] are easily enumerated. Further the time complexity of the proposed algorithm has also been investigated. The algorithm has been implemented using object oriented programming language-Java.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
