Algorithms are the sets of steps necessary to complete computation. Algorithms are the sets of steps necessary to complete computation - they are at the heart of what our devices actually do. And this ...

Anyone who has taken a basic computer science class has undoubtedly spent time devising a sorting algorithm—code that will take an unordered list of items and put them in ascending or descending order ...

From greedy shortcuts to dynamic programming guarantees, algorithm design techniques are the backbone of efficient problem-solving in computer science. Understanding when and how to apply each ...

We don’t need to tell you that data can be beautiful—but the process of putting it in order can look pretty darn good, too. A new site called SORTING aims to make people aware of just how elegant some ...

Computers are all around us. How does this affect the world we live in? This course is a broad introduction to computing technology for humanities and social science students. Topics will be drawn ...

*Note: This course description is only applicable for the Computer Science Post-Baccalaureate program. Additionally, students must always refer to course syllabus for the most up to date information.

A puzzle that has long flummoxed computers and the scientists who program them has suddenly become far more manageable. A new algorithm efficiently solves the graph isomorphism problem, computer ...

The Saint Louis University Department of Computer Science offers courses at the undergraduate and graduate level. Content below is provided by SLU Academic Catalog. A broad survey of the computer ...