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)
We've a killer team at the helm
Here is our current member's and the team.
Almaz
Tukenov
Lab Leader
Daniyar
Kayirbolatov
Member
Talgat
Yegizbayev
Member
M. Bedir
Tapkan
Member
Nadide
Pasali
Member
Inamullah
Rasuna
Member- All
- Algorithm
- Activities
- Information
ACM-ICPC Preparation Project
Posted on August 24thThis GitHub project that one of the ongoing project of our lab aim to guide people in competitive programming.
Author: Nadide PasaliRead The Rest
Max Flow/Min Cut Algorithm
Posted on September 9Ford Felkurson's Max Flow algorithm. Explaining the logic, helping to understand.
Author: Inamullah MuhammadRead The Rest
Knapsack Algorithm
Posted on September 15thKnapsack algorithm explained. What is the logic, how to code it ?
Author: Almaz TukenovRead The Rest
Kadane's Algorithm
Posted on September 18thHow to find sum of maximum subarrays? Kadane's algorithm for optimal solution.
Author: Bedir TapkanRead The Rest
Minimum Spanning Tree (MST) Algorithms
Posted on September 19thMinimum spanning tree problem is find a subset of edges that connects all nodes with minimum cost in weighted graph.
Author: Nadide PasaliRead The Rest
Modular Exponentiantion
Posted on September 19thMinimum spanning tree problem is find a subset of edges that connects all nodes with minimum cost in weighted graph.
Author: Nadide PasaliRead The Rest
Sieve of Eratoshenes
Posted on September 19thMinimum spanning tree problem is find a subset of edges that connects all nodes with minimum cost in weighted graph.
Author: Almaz TukenovRead The Rest
Sieve of Eratoshenes
Posted on November 20thHow to efficiently factorize numbers ?
Author: Bedir TapkanRead The Rest
Check out some of our
latest and greatest projects
Here are our projects...
- All
- Algorithms
- Leadership
