Sunday, April 2, 2017

Search algorithm small talk

April 2, 2017

Introduction


Julia likes to do some study about search algorithm, the search can be median value, min/ max value, in other words, no need to sort the array.

Graduated from applied mathematics major back to 1988 and worked on math graduate study from 1996 to 1997, Julia started to follow the theoretic computer science on stackexchange.com starting from March 2017, she likes to train herself and execute her analysis talent learned and trained in her mathematics study.

Design a data structure? not completed sorted, not a binary search tree, should be a binary tree. How to determine two trees or one tree? If there are two trees involved in algorithm, then one or two data structures?

After searching past experience using median, kth largest/ smallest element, max, min on this coding blog, Julia found this algorithm called Leetcode 295.

Leetcode 295 discussion to read, link is here.

Julia likes to be a good data structure designer one day.


Search Algorithm study 


Plan to work on computer theory, median algorithms.

Here are median algorithm questions to study.

An algorithm problem and a blog -

Algorithm for 'k'' most frequently occurring numbers

How good a computer professor can write a blog? What I should learn from the blog and author?

Search heap data structure - content is here to read.

Array implementation of dictionary data structure

Study of computer algorithm professionals 


Julia likes to find something to work on - find a good mentor on algorithm analysis; Always find experts first, and then take some time to read questions and answers on algorithms.


1. UC riverside algorithm professor

Neal, E. Young - professor profile

Algorithms courses taught

Read some answers, evaluate how much Julia can understand the theory part.

Answers on cstheory

2. Utah professor - Suresh Venkat

Algorithm study stages - teaching

No comments:

Post a Comment