Computational Complexity vs Computer Science Converter

This app demonstrates the basic principles of computational complexity. The growth of a few typical Big-O functions are illustrated with an interactive graph, and live demonstrations of sorting algorithms can be run using randomly generated data. This app was developed at SUNY Binghamton, by Prof. Patrick H. Madden. Version 1.1 is an expansion on this, with the assistance a few students (primarily Keith Gardner, and undergrad, and Anthony Canino, an MS grad). We're working on the app as a fun project, and as a way to introduce ACM student group members to iOS programming. The source for the app is available on Github; we'll be adding more algorithms and things, and if you're interested in helping out with the development, let us know! https://github.com/keithgardner2/complexity Yay computational complexity! Yay Hartmanis and Stearns!

Easily and simultaneously convert between: Unsigned Conversions: - Decimal (dec) - Binary (bin) - Hexadecimal (hex) - Octal (Oct) Signed Conversions: - 16-Bit Integers - 32-Bit Integers - Binary (Two’s Complement) - Hexadecimal (Two’s Complement) Text: - String - Decimal - Binary (New) - Hexadecimal IP Addresses: - Binary, and Decimal Conversions Subnetting: - Create and Find subnets - Identifies IP address class - Shows Subnet IDs for each subnet in binary and decimal - Shows Broadcast ID and host range for each subnet ID - Shows the total number of bits stolen, and the total number of hosts Calculate Bitwise Operations: - AND - OR - XOR - NOT - LEFT SHIFT - RIGHT SHIFT Good for computer science related tasks. - Networking - Assembly Language - Language Processing - Operating Systems - etc.