← Back to Home

Practice: Sorting and Hash Tables

Now it's time to practice what you learned!

You should have already created your Code Signal account. If you have not done so yet, please follow these instructions What is CodeSignal and How to Create Your Account

Tip: Before you dive into the practice tasks, revisit the core competency and guided project videos in this sprint.

Practice Modules

Basic Sorting Algorithms

This module focuses on fundamental sorting algorithms:

Bubble Sort: Implementation and optimization
Selection Sort: Understanding selection-based sorting
Insertion Sort: Efficient sorting for small or nearly sorted lists
Algorithm analysis: Comparing time and space complexity

Access ACS2M7 Practice Module

Advanced Sorting Algorithms

This module covers more efficient sorting techniques:

Merge Sort: Divide and conquer sorting approach
Quick Sort: Partition-based efficient sorting
Hybrid sorting approaches: Combining different algorithms
Performance analysis: Understanding O(n log n) sorting

Access ACS2M8 Practice Module

Hash Tables

This module explores hash table implementation and applications:

Hash functions: Designing efficient hash functions
Collision resolution: Handling hash collisions
Hash table operations: Insert, search, and delete
Hash table applications: Solving problems with hash tables

Access ACS2M9 Practice Module

Instructions

Login to CodeSignal
Click on the task links above
Select your preferred language
Click on NEXT to begin
Agree with the Terms and Pledges and click START

Once all the questions for each task are completed in Code Signal, click on Finish the Test.

Remember to review the related module materials: