All language subtitles for 1 - Course Overview English

Hi and welcome to comprehensive algorithms.

My name's Jordan Hudgens and I'll be the instructor for this course throughout the 25 videos that are

associated with this curriculum will be able to cover a wide range of algorithm design and analysis

tools before we even get started on that.

One of the first things to think of is to know why you should be studying algorithms and there's a few

different reasons.

One of the top ones for me is to increase performance of applications whether it's sorting or it's building

a complex rating module building out an algorithm is always one of the most important parts of any kind

of programming or development.

And so being able to know what makes a good algorithm and also when certain algorithms have already

been created and you can simply use those is very important.

Another reason are for academic pursuits.

In fact this course was actually started when I began taking graduate school courses at Texas Tech University

for computer science and I wanted to understand how algorithms are developed better.

And one of the best ways that I learn is to teach.

And so that's why I came up with this course then.

The last reason is I have a deeper understanding of computer science.

If you want to go deeper and learn about things such as machine learning or artificial intelligence

parallel systems or really anything having to deal with advanced programming techniques and computer

science tools you really need to understand how algorithms work and also be able to analyze them.

When you see them in this course we have 25 videos covering several hours of content and it's broken

up into seven sections.

We cover the growth of functions which states exactly why you need to know algorithms because you see

how quickly algorithms can really slow down your program if they're not built properly.

Then we go into sorting algorithms and we talk about very simple to use sorting methodologies all the

way to very complex very advanced systems.

Then we go into data structures where we focus on abstract data structures such as stacks and cues and

then binary search trees red black trees which are a balanced form of binary search trees graph algorithms

or we study things such as Prim's algorithm for minimum spanning trees along with Euler and Hamiltonian

Pownce and a number of other topics.

And then we finish off with advanced algorithms and that's going to cover some very high end computer

science studies.

And I think it will be a great introduction to you know going further into your knowledge of computer

science and programming about myself.

I'm currently a computer science grad student at Texas Tech University.

I'm also the director of I.T. for Dixie electric and I have 10 years of development and teaching experience.

I also have a number of other courses on you to me and I've been able to work with thousands of students

over the years and so it's something they definitely love to do and I always want my students to feel

free to contact me at any time.

Please feel free to email me through you to me or post on the discussion boards.

I'm always very active in being able to work with my students help anybody through any problems they

may be having.

And also if you have any more advance questions I may even add more videos to the course as I see those

come in.

So thanks for taking the time to watch this video and I look forward to going through the course with

you.