Jonkman Microblog
  • Login
Show Navigation
  • Public

    • Public
    • Network
    • Groups
    • Popular
    • People

Conversation

Notices

  1. tekk (tekk@social.tekk.in)'s status on Wednesday, 27-Sep-2017 00:43:34 EDT tekk tekk
    @lottievixen You did, but no worries. Here's the deal: Build me a stack which has the normal stack routines (push, pop) but it also has another one: find-min. Each of these 3 functions should run in constant (O(1)) time. You can use as much memory as you want, so yes @er1n you can have another stack, although saying it out loud spoils the solution a bit ;)
    In conversation Wednesday, 27-Sep-2017 00:43:34 EDT from social.tekk.in permalink
    1. tekk (tekk@social.tekk.in)'s status on Wednesday, 27-Sep-2017 00:44:37 EDT tekk tekk
      in reply to
      Oh yeah, and you're *implementing* the stack, so you can implement all of the methos and the actual storage however you want.
      In conversation Wednesday, 27-Sep-2017 00:44:37 EDT from social.tekk.in permalink
  • Help
  • About
  • FAQ
  • TOS
  • Privacy
  • Source
  • Version
  • Contact

Jonkman Microblog is a social network, courtesy of SOBAC Microcomputer Services. It runs on GNU social, version 1.2.0-beta5, available under the GNU Affero General Public License.

Creative Commons Attribution 3.0 All Jonkman Microblog content and data are available under the Creative Commons Attribution 3.0 license.

Switch to desktop site layout.