Categories
- agile (3)
- algorithms (34)
- cheatsheets (2)
- css (29)
- download (3)
- featured (46)
- flex 3 (25)
- javascript (139)
- micro tutorial (203)
- PHP (111)
- portfolio (5)
- quiz (7)
- snippets (7)
- video (1)
- web development (168)
- zend framework (81)
Tag Archives: Computing
Computer Algorithms: Data Compression with Relative Encoding
Overview Relative encoding is another data compression algorithm. While run-length encoding, bitmap encoding and diagram and pattern substitution were trying to reduce repeating data, with relative encoding the goal is a bit different. Indeed run-length encoding was searching for long … Continue reading
Posted in algorithms
Tagged Africa, Algorithm, Algorithmic efficiency, Application This algorithm, Computing, Data compression, data compression algorithm, Google Inc., JSON, Lossless data compression, Mathematics, PHP, Run-length encoding, San Francisco, Technology/Internet, web server, west coast, Yahoo! Communications Europe Ltd.
Leave a comment
JavaScript Performance: for vs. while
JavaScript Loops If you have read some preformance tests on JavaScript loops, you may have heard that “while” is faster than “for”. However the question is how faster is “while”? Here are some results, but first let’s take a look … Continue reading
Computer Algorithms: Data Compression with Diagram Encoding and Pattern Substitution
Overview Two variants of run-length encoding are the diagram encoding and the pattern substitution algorithms. The diagram encoding is actually a very simple algorithm. Unlike run-length encoding, where the input stream must consists of many repeating elements, as “aaaaaaaa” for … Continue reading
Posted in algorithms, PHP
Tagged Coding theory, Computer file formats, Computer science, Computing, conventional compressing tool, Data compression, html, Information theory, Lossy compression, pattern substitution algorithm, pattern substitution algorithms, Pattern Substitution The pattern substitution algorithm, PHP, Run-length encoding, web hosting
Leave a comment
Computer Algorithms: Data Compression with Bitmaps
Overview In my previous post we saw how to compress data consisting of very long runs of repeating elements. This type of compression is known as “run-length encoding” and can be very handy when transferring data with no loss. The … Continue reading
Computer Algorithms: Linear Search in Sorted Lists
Overview The expression “linear search in sorted lists” itself sounds strange. Why should we use this algorithm for sorted lists when there are lots of other algorithms that are far more effective? As I mentioned in my previous post the … Continue reading