---

Home Developer

Command Line Efficiency with GNU Perfect

By

[ Thanks to LinucksGirl for this link.
]

“This is where gperf comes in. It generates a hash
table from the predetermined list of valid command-line options and
a lookup function whose time complexity is O(1). Thus, for a
typical program invocation with N options, the code needs only O(N)
[N*O(1)] comparisons–an order of magnitude improvement over the
legacy code…”

Complete
Story

Get the Free Newsletter!

Subscribe to Developer Insider for top news, trends, & analysis

Must Read

LinuxToday is a trusted, contributor-driven news resource supporting all types of Linux users. Our thriving international community engages with us through social media and frequent content contributions aimed at solving problems ranging from personal computing to enterprise-level IT operations. LinuxToday serves as a home for a community that struggles to find comparable information elsewhere on the web.

Our Brands

Advertiser Disclosure: Some of the products that appear on this site are from companies from which TechnologyAdvice receives compensation. This compensation may impact how and where products appear on this site including, for example, the order in which they appear. TechnologyAdvice does not include all companies or all types of products available in the marketplace.