Sorting Algorithm Overview

• This chapter introduces commonly used sorting algorithm (Covered all sorting algorithm in COMP90038 course).
• Covered:
  • Selection Sort
  • Insertion Sort
  • Shell Sort
  • Quick Sort
  • Merge Sort
  • Heap Sort
  • Sort by Counting
  • Analysis and Comparison between these algorithms(Time-Complexity, Stable, In-place, Input-insensitive)
  • Sample Question In Real Examination
    Read more »

Time Complexity Overview

• This chapter introduces how to calculate the time complexity of a algorithm no matter it is recursive or just a normal algorithm.

Data Structure Overview

• Array
• Linked List
• Stack
• Queue
• Priority Queue
• Binary Tree
• Hashing

• These top 15 questions are squeezed from nearly all searchable examination papers online
• This post is only useful for unimelb student from COMP90041 course

New York City Taxi Fare Prediction - TOP 2% TEAM!

• Author: Chongzheng Zhao
• Kaggle Competition - New York City Taxi Fare Prediction
• FINAL BEAT 1454 TEAMS!
• We team NYCTAXI located at 30 out of 1484 teams, Top 2%!
• Final Score 2.86770
• Competition Official Website: https://www.kaggle.com/c/new-york-city-taxi-fare-prediction
• To see the leaderboard(competition result): https://www.kaggle.com/c/new-york-city-taxi-fare-prediction/leaderboard
• Welcome to my Github Profile: https://github.com/ChongzhengZhao/
• Welcome to my Kaggle Profile: https://www.kaggle.com/chongzhengzhao
• Welcome to my Linkedin Profile: https://www.linkedin.com/in/chongzhengzhao/