In CSE 261 (Discrete Structures) we are begin to learn about algorithms. Algorithms are processes that lead to a solution. I already learned about algorithms in CSE 17 which is a class on Java and CSE 327 which is a class on Artificial Intelligence. This previous knowledge should make this topic very easy for me. Next semester I am taking CSE 340 which is actually a class on algorithms and I heard it is one of the most useful computer science classes at Lehigh. In CSE 261 we are going to learn search, sort, and optimization algorithms. Search algorithms try to find a solution or the best solution as quickly as possible. Sort algorithms may take an array or list and put it in a certain order. Optimization algorithms can be similar to the search algorithms in that they both try to find the best solution typically. Some examples of algorithms that I have learned so far are: bubble sort, merge sort, depth-first search, breadth-first search, greedy-search, A* search, etc.

This entry was posted in Uncategorized. Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s