Jump to content

Peepeepoopoo

Veterans
  • Posts

    1161
  • Joined

  • Last visited

  • Days Won

    8

 Content Type 

Profiles

Forums

Events

Reborn Development Blog

Rejuvenation Development Blog

Desolation Dev Blog

Everything posted by Peepeepoopoo

  1. Ayyayyayayayay happy birthday even though I don't know you Don't party too hard.
  2. 225 also I noticed 420 posts ayayayayay even though I don't smoke
  3. Peepeepoopoo

    Aipom

    I'm pretty sure you need to headbutt trees. Are you headbutting trees?
  4. Hello Shawn, Enjoy the forums. Love, Dark
  5. I started in high school, my friends got me into it. It was when gen 5 was big and gen 6 was still unannounced. One of my friends would run Toxic Orb Gliscor a lot, so I did a gimmicky rotation battle team that I got off of the YouTubes and dumpstered him. I stopped playing after gen 6 came out though because school and stuff.
  6. Sure in competitive battling but maybe not in the game. Swablu is pretty bad early levels (just like Noibat) but once it evolves and gets moves it can be a great support. Especially with Natural Cure or Cloud Nine. With moves like Cotton Guard, Sing, Moonblast, it'll be a great Pokemon to have and I wouldn't be surprised if it made its way up to A rank in the ranking thread.
  7. Well that's because Reborn has themes covering these kinds of topics. Thus it attracts all sorts of people who are open and welcoming. Thank Ame (if you haven't already) for making such a great game that has brought us all together.
  8. Yes, that's basically what algorithm analysis is :3 We don't time how long it takes for them to complete though, because the amount of time any algorithm takes to complete is dependent on the size of the problem (how much data you have to sort). However we can classify a runtime complexity that helps us determine which algorithm will be faster. For example a search algorithm with complexity of O(n) will always finish faster than a search algorithm with complexity of O(n^2) (provided of course that the algorithms work on the same problem). EDIT; (n is the size of the problem by the way)
  9. Well I'm sure you know that there are things such as arrays, array lists, trees, graphs, etc. in programming. These are all types of data structures and we use them for various purposes. There are lots of different types of data structures (many types of trees and graphs) and each data structure has its uses. Some data structures are great for storing data, others are great for retrieving data (searching) and some are good for sorting data (greatest to least, alpha order). When I say good at, I mean they have a low runtime complexity (basically they run faster than something with a high runtime complexity ) Algorithm analysis is basically looking at algorithms and figuring out what their runtime complexity is. There are like three or four notations that are used for different types of runtime complexity analysis but the one I've learned is the worst case runtime analysis which is big-O notation. So many exam questions asking to formally prove the runtime complexity of certain algorithms holy shit, they were killer :'( but it's good to know the runtime complexity of algorithms so you know which is better to use in certain scenarios. You can find the complexity for lots of popular algorithms like bubble sort and merge sort on the internet if you just do a quick google search. You can also formally prove the runtime complexity of your own algorithms if you write one. Edit; also yeah I thought of this name (don't ask me for origin stories this thread isn't even about me) when I named a character for an MMORPG I used to play and everyone there called me Dark (some people got my name confused and called me DarkSprite as well ). Where'd your name come from alecz? I'm assuming it's just another way to spell the name Alex?
  10. Umm...what? This thread was posted today and Chrome and I answered you today (within 24 hours at least). But it's good to hear that you found it anyway it's a damn useful TM.
  11. How dare you?! How can you NOT love this?!
  12. DarkSPITE not SPRITE ;_>; people get that mixed up all the time </3 Yeah I loved my programming courses, they were always lots of fun. I'm more into the algorithm analysis and data structures side of things, it's quite fun. Very akin to puzzles :3 never learned by myself though, I can't be assed to learn anything by myself, too lazy Well I guess I'm learning something on my own. I'm working on a fangame with some other members here, it's called Pokemon Se7en. You should check it out if you're interested (it's not released yet though, we're still working on the initial release). I've been having to learn how to use RPG Maker and the scripting language it uses as I help them make the game.
  13. You have to enter the tree from the top. Just go down the ledges and stick to the left.
  14. ALTARIA HERE I COME. About time we get a dragon type :3
×
×
  • Create New...