Background Image
Welcome To

ACM-ICPC Algorithms Lab

Join Us

What are we doing?

Some of our programs and our schedule

This program developed to learn Algorithms for using in Competitive Programming, but can be used for:

  • • Competitive Programming
  • • Practicing for Interviews
  • • Improving Algorithmic Thinking
  • • Practicing for College Class
  • • FUN.

Meetings every week on Friday from 9:00am - 6:00pm at NAU Research Room 8 Floor (opposite to Student Service)

  • • 9:00am - 1:00pm (Contest 11 question 5 hours)
  • • 1:00pm - 2:30pm (Lunch Break)
  • • 2:30pm - 4:30pm (Contest Problem solving together)
  • • 4:30pm - 6:00pm (One member gives Lecture of one Algorithm)

Product Image
  • "We can not solve our problems with the same level of thinking that created them." Albert Einstein

  • "If I had an hour to solve a problem I'd spend 55 minutes thinking about the problem and 5 minutes thinking about solutions." Albert Einstein

  • An algorithm must be seen to be believed.

We've a killer team at the helm

Here is our current member's and the team.

Team Member
Almaz
Tukenov
Lab Leader
Team Member
Daniyar
Kayirbolatov
Member
Team Member
Talgat
Yegizbayev
Member
Team Member
M. Bedir
Tapkan
Member
Team Member
Nadide
Pasali
Member
Team Member
Inamullah
Rasuna
Member
  • All
  • Algorithm
  • Activities
  • Information
Blog Preview

ACM-ICPC Preparation Project

Posted on August 24th

This GitHub project that one of the ongoing project of our lab aim to guide people in competitive programming.

Author: Nadide Pasali
Read The Rest
Blog Thumb

Max Flow/Min Cut Algorithm

Posted on September 9

Ford Felkurson's Max Flow algorithm. Explaining the logic, helping to understand.

Author: Inamullah Muhammad
Read The Rest
Blog Thumb

Knapsack Algorithm

Posted on September 15th

Knapsack algorithm explained. What is the logic, how to code it ?

Author: Almaz Tukenov
Read The Rest
Blog Thumb

Kadane's Algorithm

Posted on September 18th

How to find sum of maximum subarrays? Kadane's algorithm for optimal solution.

Author: Bedir Tapkan
Read The Rest
Blog Thumb

What is Algorithm

Posted on May 1st 2015

Author: Nadide Pasali
Read The Rest
Blog Thumb

Minimum Spanning Tree (MST) Algorithms

Posted on September 19th

Minimum spanning tree problem is find a subset of edges that connects all nodes with minimum cost in weighted graph.

Author: Nadide Pasali
Read The Rest
Blog Thumb

Modular Exponentiantion

Posted on September 19th

Minimum spanning tree problem is find a subset of edges that connects all nodes with minimum cost in weighted graph.

Author: Nadide Pasali
Read The Rest
Blog Thumb

Sieve of Eratoshenes

Posted on September 19th

Minimum spanning tree problem is find a subset of edges that connects all nodes with minimum cost in weighted graph.

Author: Almaz Tukenov
Read The Rest
Blog Thumb

Sieve of Eratoshenes

Posted on November 20th

How to efficiently factorize numbers ?

Author: Bedir Tapkan
Read The Rest