Recursive algorithms in computer science courses: Fibonacci numbers and binomial coefficients

We observe that the computational inefficiency of branched recursive functions was not appropriately covered in almost all textbooks for computer science courses in the first three years of the curriculum. Fibonacci numbers and binomial coefficients were frequently used as examples of branched recur...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on education Vol. 43; no. 3; pp. 273 - 276
Main Author: Stojmenovic, I.
Format: Journal Article
Language:English
Published: New York IEEE 01.08.2000
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Binomial coefficients
Branched
Complexity
Computer science education
Education
Fibonacci numbers
Proving
Recursive functions
Textbooks
ISSN:0018-9359, 1557-9638
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract We observe that the computational inefficiency of branched recursive functions was not appropriately covered in almost all textbooks for computer science courses in the first three years of the curriculum. Fibonacci numbers and binomial coefficients were frequently used as examples of branched recursive functions. However, their exponential time complexity was rarely claimed and never completely proved in the textbooks. Alternative linear time iterative solutions were rarely mentioned. We give very simple proofs that these recursive functions have exponential time complexity. The proofs are appropriate for coverage in the first computer science course.
AbstractList We observe that the computational inefficiency of branched recursive functions was not appropriately covered in almost all textbooks for computer science courses in the first three years of the curriculum. Fibonacci numbers and binomial coefficients were frequently used as examples of branched recursive functions. However, their exponential time complexity was rarely claimed and never completely proved in the textbooks. Alternative linear time iterative solutions were rarely mentioned. We give very simple proofs that these recursive functions have exponential time complexity. The proofs are appropriate for coverage in the first computer science course.
We observe that the computational inefficiency of branched recursive functions was not appropriately covered in almost all textbooks for computer science courses in the first three years of the curriculum. Fibonacci numbers and binomial coefficients were frequently used as examples of branched recursive functions. However, their exponential time complexity was rarely claimed and never completely proved in the textbooks. Alternative linear time iterative solutions were rarely mentioned. We give very simple proofs that these recursive functions have exponential time complexity. The proofs are appropriate for coverage in the first computer science course
Author Stojmenovic, I.
Author_xml – sequence: 1
  givenname: I.
  surname: Stojmenovic
  fullname: Stojmenovic, I.
  organization: Dept. of Comput. Sci., Ottawa Univ., Ont., Canada
BookMark eNqF0U1LxDAQBuAgCu6uHrx6Kh4UD9V8NGniTRZXBUEQPUpJ06lG2mRNWsF_b5YVD4voKUzmeQOTmaJt5x0gdEDwGSFYnRN2JgWnGG-hCeG8zJVgchtNMCYyV4yrXTSN8S2VBad8gp4fwIwh2g_IdPfigx1e-5hZlxnfL8cBQhaNBWcgXSQH8SJb2No7bYzN3NjXEGKmXZPV1vne6i45aFu7Cg1xD-20uouw_33O0NPi6nF-k9_dX9_OL-9yw0Q55EJqySgDWjS1JlIzRSUrucCqwEYaSnmDMa-BgVRtw3iNOQdRixQCrBrKZuhk_e4y-PcR4lD1NhroOu3Aj7FSpBCMy2Ilj_-UVPJSMYn_h6WQVPAywaMN-JZ-yqVxK0UZTmMUK3S-Rib4GAO0lbGDHqx3Q9C2qwiuVuurCKvW60uJ043EMtheh89f7eHaWgD4cd_NLycloxI
CODEN IEEDAB
CitedBy_id crossref_primary_10_1016_j_scico_2011_10_001
crossref_primary_10_1515_INTEG_2009_051
crossref_primary_10_3390_s121216211
crossref_primary_10_1007_s12215_024_01143_y
crossref_primary_10_1109_LCOMM_2006_060657
crossref_primary_10_3390_axioms13070420
crossref_primary_10_1088_0143_0807_36_6_065005
crossref_primary_10_5269_bspm_52209
crossref_primary_10_1007_s12555_017_0624_y
crossref_primary_10_5937_MatMor2501113V
crossref_primary_10_2478_amsil_2023_0020
Cites_doi 10.1109/13.502075
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2000
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2000
DBID RIA
RIE
AAYXX
CITATION
7SC
7SP
7TB
8FD
FR3
JQ2
KR7
L7M
L~C
L~D
F28
DOI 10.1109/13.865200
DatabaseName IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Mechanical & Transportation Engineering Abstracts
Technology Research Database
Engineering Research Database
ProQuest Computer Science Collection
Civil Engineering Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
ANTE: Abstracts in New Technology & Engineering
DatabaseTitle CrossRef
Civil Engineering Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Mechanical & Transportation Engineering Abstracts
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Engineering Research Database
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
ANTE: Abstracts in New Technology & Engineering
DatabaseTitleList Technology Research Database
Civil Engineering Abstracts

Civil Engineering Abstracts
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Education
EISSN 1557-9638
EndPage 276
ExternalDocumentID 2593279391
10_1109_13_865200
865200
GroupedDBID -~X
0R~
29I
3EH
4.4
5GY
5VS
6IK
85S
97E
AAJGR
AARMG
AASAJ
AAVXG
AAWTH
AAYJJ
ABAZT
ABFSI
ABOPQ
ABQJQ
ABVLG
ACGFO
ACGFS
ACIWK
ACNCT
AENEX
AETIX
AFFNX
AFOGA
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AKJIK
AKQYR
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ASUFR
ATWAV
AZLTO
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
E.L
EBS
EJD
HZ~
H~9
IAAWW
IBMZZ
ICLAB
IDIHD
IFIPE
IFJZH
IPLJI
JAVBF
LAI
M43
MS~
O9-
OCL
P2P
PQQKQ
RIA
RIE
RNS
TN5
VH1
AAYXX
CITATION
7SC
7SP
7TB
8FD
FR3
JQ2
KR7
L7M
L~C
L~D
RIG
F28
ID FETCH-LOGICAL-c367t-68a8323e24dba18a392837560940c8c225d005be3e89fd35b055e6b6832e09d23
IEDL.DBID RIE
ISICitedReferencesCount 14
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000089068800006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0018-9359
IngestDate Thu Oct 02 04:11:19 EDT 2025
Sun Sep 28 12:07:04 EDT 2025
Mon Sep 29 06:19:30 EDT 2025
Mon Jun 30 06:57:43 EDT 2025
Tue Nov 18 21:40:51 EST 2025
Sat Nov 29 05:19:42 EST 2025
Tue Aug 26 21:00:26 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 3
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c367t-68a8323e24dba18a392837560940c8c225d005be3e89fd35b055e6b6832e09d23
Notes ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
PQID 923075647
PQPubID 23500
PageCount 4
ParticipantIDs proquest_miscellaneous_27682657
crossref_citationtrail_10_1109_13_865200
crossref_primary_10_1109_13_865200
ieee_primary_865200
proquest_miscellaneous_914635842
proquest_miscellaneous_28579380
proquest_journals_923075647
PublicationCentury 2000
PublicationDate 2000-08-01
PublicationDateYYYYMMDD 2000-08-01
PublicationDate_xml – month: 08
  year: 2000
  text: 2000-08-01
  day: 01
PublicationDecade 2000
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE transactions on education
PublicationTitleAbbrev TE
PublicationYear 2000
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References cormen (ref10) 1990
kruse (ref2) 1997
standish (ref6) 1994
tucker (ref8) 1994
koffman (ref5) 1995
tucker (ref3) 1994
koffman (ref7) 1994
sedgewick (ref11) 1988
ref1
naps (ref4) 1995
rawlins (ref9) 1992
References_xml – year: 1994
  ident: ref3
  publication-title: Fundamentals of Computing I
– year: 1995
  ident: ref4
  publication-title: Introduction to Computer Science Programming Problem Solving and Data Structures
– year: 1988
  ident: ref11
  publication-title: J Algorithms
– year: 1994
  ident: ref7
  publication-title: Software Design and Data Structures in Turbo Pascal
– year: 1995
  ident: ref5
  publication-title: Pascal
– year: 1994
  ident: ref8
  publication-title: Fundamentals of Computing II
– year: 1994
  ident: ref6
  publication-title: Data Structures Algorithms and Software Principles
– year: 1992
  ident: ref9
  publication-title: Compared to What? An Introduction to the Analysis of Algorithms
– ident: ref1
  doi: 10.1109/13.502075
– year: 1990
  ident: ref10
  publication-title: Introduction to Algorithms
– year: 1997
  ident: ref2
  publication-title: Data Structures and Program Design in C
SSID ssj0014525
Score 1.6093054
Snippet We observe that the computational inefficiency of branched recursive functions was not appropriately covered in almost all textbooks for computer science...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 273
SubjectTerms Binomial coefficients
Branched
Complexity
Computer science education
Education
Fibonacci numbers
Proving
Recursive functions
Textbooks
Title Recursive algorithms in computer science courses: Fibonacci numbers and binomial coefficients
URI https://ieeexplore.ieee.org/document/865200
https://www.proquest.com/docview/923075647
https://www.proquest.com/docview/27682657
https://www.proquest.com/docview/28579380
https://www.proquest.com/docview/914635842
Volume 43
WOSCitedRecordID wos000089068800006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE Electronic Library (IEL)
  customDbUrl:
  eissn: 1557-9638
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0014525
  issn: 0018-9359
  databaseCode: RIE
  dateStart: 19630101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8QwEA4qHvTgY1Vcn0E8eKm2TZsm3kRcPImIghcpTTrVwtrKdtff7-Sxi-IDvJVkQkOSyUwyk-8j5LiMlZJYF1Q6VEGScQgE4zJA4wzSgK0kwpFNZDc34vFR3nqcbfsWBgBs8hmcmk8byy9bPTFXZWeCG5CgeTKfZdw91ZoFDEx4zm26qL8slR5EKArlWcROXcMvpsdyqXzbgK1VGaz-qz9rZMU7j_TCzfY6mYOmZ3iXfY5Gjyx_ghfcIE935jLd5KfTYvjcjurxy2tH64ZqT-VAvf3DApvLcU4HtULXXOuaOqqQjhZNSfH03L7iQkU5sJATJvtikzwMru4vrwNPpxBoxrNxwEWB6ssgTkpVRKJAzwgnAz0emYRaaFTsElVSAQMhq5KlKkxT4IpjIwhlGbMtstC0DWwTmkJWCKEr82o2qSItlSHZrHiYaHQ4hO6Tk-lI59pjjRvKi2FuzxyhzCOWu9Hrk6OZ6JsD2PhJqGdGfyYwLd2dzl7uNa_LpclsT3mS9cnhrBZVxsRBigbaSZfHeMSKefqXhEhx3xL4B_qLhEQLw9B5i3d-7NouWXJv9k2m4B5ZGI8msE8W9fu47kYHdul-AEau7R0
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3fi9QwEB70FNQHf6yK66kXxAdfetc2bZr4JuJy4rmInHAvUpp0qoW7Vra7_v3OJNlF8RR8K8mEhiSTmWQm3wfwos2tNVSXdC61SVEpTLRUJiHjjIbBVgodyCaq5VKfnZmPEWfbv4VBRJ98hof86WP57eg2fFV2pBWDBF2Fa0ycZcJjrV3IgAN0YdslDZaliTBCWWqOMnkYmv5mfDybyh9bsLcrizv_1aO7cDu6j-J1mO97cAWHGTMvxyyNGdz6BWDwPnz5xNfpnKEumvOv46pff7uYRD8IF8kcRLSAVOCzOV6JRW_JOXeuF4EsZBLN0Ao6P48XtFRJDj3oBOdfPIDPi7enb46TSKiQOKmqdaJ0QwosMS9a22S6Id-IpoN8HlOkTjtS7ZaU0qJEbbpWljYtS1RWUSNMTZvLh7A3jAM-AlFi1WjtOn43W3SZM5ZpNjuVFo5cDu3m8HI70rWLaONMenFe-1NHaupM1mH05vB8J_o9QGxcJjTj0d8JbEv3t7NXR92basO57aUqqjkc7GpJaTgS0gw4bqY6p0NWrsp_SeiSdi5NfxB_kTBkYyS5b_njS7t2ADeOTz-c1Cfvlu_34WZ4wc95g09gb73a4FO47n6s-2n1zC_jn9K68Gw
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Recursive+algorithms+in+computer+science+courses%3A+Fibonacci+numbers+and+binomial+coefficients&rft.jtitle=IEEE+transactions+on+education&rft.au=Stojmenovic%2C+I&rft.date=2000-08-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.issn=0018-9359&rft.eissn=1557-9638&rft.volume=43&rft.issue=3&rft.spage=273&rft_id=info:doi/10.1109%2F13.865200&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=2593279391
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9359&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9359&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9359&client=summon