Algorithm Projects with Go

Sorting and Searching you own this product

This project is part of the liveProject series Six Small Algorithm Projects with Go
arrays • slices • structs
skills learned
bubblesort • quicksort • counting sort • linear search • binary search • simple recursion
Rod Stephens
1 week · 4-6 hours per week · BEGINNER

pro $24.99 per month

  • access to all Manning books, MEAPs, liveVideos, liveProjects, and audiobooks!
  • share your subscription with another person
  • choose one free eBook per month to keep
  • exclusive 50% discount on all purchases

lite $19.99 per month

  • access to all Manning books, including MEAPs!


5, 10 or 20 seats+ for your team - learn more

Look inside

There’s a lot of buzz about the Bug of the Month club you started, but the fly in the ointment is that a few customers aren’t paying their bills on time. You have no choice but to halt their monthly shipments of fine insect-based foods. But to do that, you must first identify the delinquent customers. Using three different Go sorting algorithms—bubble sort, quicksort, and counting sort—you’ll sort your list of customers by balance owed. Once your data is sorted, making it easier to search, you’ll implement a linear search as well as a binary search to locate the non-paying culprits. When you’re done, you’ll have firsthand experience implementing widely used Go sort algorithms and search methods and a firm grasp on their performance.

This project is designed for learning purposes and is not a complete, production-ready application or solution.

book resources

When you start your liveProject, you get full access to the following books for 90 days.

project author

Rod Stephens

Rod Stephens started out as a mathematician but discovered the fun of algorithms and has been programming ever since. Rod was a Microsoft Visual Basic Most Valuable Professional (MVP) for 15 years, has spoken to user groups and conferences, and has taught introductory programming courses. He has written more than 35 books including Essential Algorithms: A Practical Approach to Computer Algorithms Using Python and C# and Beginning Software Engineering, both of which include material related to this series of liveProjects.


This liveProject is for Go programmers, from beginning level to advanced, who want to learn how to sort and search data using Go. To begin these liveProjects you’ll need to be familiar with the following:


  • A Go compiler (such as Visual Studio Code or Online GDB)
  • Basic math
  • Basic Go features (including arrays, structs, and slices)

you will learn

In this liveProject, you’ll learn how to implement widely used Go sort algorithms and search methods and gain a solid understanding of their performance.

  • Bubble sort
  • Quicksort
  • Counting sort
  • Linear search
  • Binary search
  • Simple recursion
  • features

    You choose the schedule and decide how much time to invest as you build your project.
    Project roadmap
    Each project is divided into several achievable steps.
    Get Help
    While within the liveProject platform, get help from other participants and our expert mentors.
    Compare with others
    For each step, compare your deliverable to the solutions by the author and other participants.
    book resources
    Get full access to select books for 90 days. Permanent access to excerpts from Manning products are also included, as well as references to other resources.

    choose your plan


    only $41.67 per month
    • five seats for your team
    • access to all Manning books, MEAPs, liveVideos, liveProjects, and audiobooks!
    • choose another free product every time you renew
    • choose twelve free products per year
    • exclusive 50% discount on all purchases
    • Sorting and Searching project for free