Skip to content

Home

Jump to bottom
Mohamed Hassan edited this page Jan 20, 2023 · 67 revisions

Prerequisites:

References:

If you're a computer science undergraduate, no worries mate 😇 and be open always. Just follow the given curriculum via accredited professors in a LEGAL university which is controlled via a Government worldwide and do their given lab-exercise besides following-up with their fellow teaching assistants

Happy coding with Code::Blocks IDE 😍

Data Structures and Algorithms in a nutshell 😉

  • Algorithm complexity is defined by how to measure the
    • efficiency which is defined as not consuming a lot of money (fucken electricity and bare metal hardware usage) 😁 by less usage of machine's resources as much as we can along the time and
    • correctness which is defined by working as expected of a certain algorithm which is defined by a way of solving a certain problem (Just a bunch of well defined logical steps NOT INVENTING THE ATOM 🤔 as mad-scientists do. We reuse mate 😘)
  1. Computer Resources
  2. Big-O Complexity Chart
  3. Common Data Structure Operations
  4. Code::Blocks IDE
  5. Program Analysis
  6. Life needs to work as a software developer
Clone this wiki locally