Technology is wonderful. It helps us run our businesses and connects us to the world. But when computer problems get in the way of getting what you need to get done, you can go from easygoing to mad-as-a-hornet in 3 seconds flat. Before you panic or give in to the temptation to throw your computer out the window, try these easy fixes.

5 Common Computer Problems

1. Sluggish PC

A sluggish PC often means low disk space caused by an accumulation of temporary Internet files, photos, music, and downloads. One of the easiest fixes for a slow PC is to clear your cache.

The way you’ll do this will depend on the Internet browser you use:

• Chrome– On the top right-hand side of the screen, you’ll see what looks like a window blind. Click on that. Click on ‘History’ and hit ‘Clear Browsing Data’.

• Safari– On the upper left-hand side, you’ll see a tab marked ‘Safari’. Click on that. Scroll down and hit ‘Empty Cache’.

• Internet Explorer– Click on ‘Tools’ and scroll down to ‘Internet Options’. Under ‘Browsing History’ click ‘Delete’. Delete files and cookies.

• FireFox – At the top of the window click ‘Tools’ then go to ‘Options’. Select the ‘Advanced’ panel and click on the ‘Network’ tab. Go to ‘Cached Web Content’ and hit ‘Clear Now’.

The original article was posted by Michael Veksler on Quora

A very well known fact is that code is written once, but it is read many times. This means that a good developer, in any language, writes understandable code. Writing understandable code is not always easy, and takes practice. The difficult part, is that you read what you have just written and it makes perfect sense to you, but a year later you curse the idiot who wrote that code, without realizing it was you.

The best way to learn how to write readable code, is to collaborate with others. Other people will spot badly written code, faster than the author. There are plenty of open source projects, which you can start working on and learn from more experienced programmers.

Readability is a tricky thing, and involves several aspects:

1. Never surprise the reader of your code, even if it will be you a year from now. For example, don’t call a function max() when sometimes it returns the minimum().
2. Be consistent, and use the same conventions throughout your code. Not only the same naming conventions, and the same indentation, but also the same semantics. If, for example, most of your functions return a negative value for failure and a positive for success, then avoid writing functions that return false on failure.
3. Write short functions, so that they fit your screen. I hate strict rules, since there are always exceptions, but from my experience you can almost always write functions short enough to fit your screen. Throughout my carrier I had only a few cases when writing short function was either impossible, or resulted in much worse code.
4. Use descriptive names, unless this is one of those standard names, such as i or it in a loop. Don’t make the name too long, on one hand, but don’t make it cryptic on the other.
5. Define function names by what they do, not by what they are used for or how they are implemented. If you name functions by what they do, then code will be much more readable, and much more reusable.
6. Avoid global state as much as you can. Global variables, and sometimes attributes in an object, are difficult to reason about. It is difficult to understand why such global state changes, when it does, and requires a lot of debugging.
7. As Donald Knuth wrote in one of his papers: “Early optimization is the root of all evil”. Meaning, write for readability first, optimize later.
8. The opposite of the previous rule: if you have an alternative which has similar readability, but lower complexity, use it. Also, if you have a polynomial alternative to your exponential algorithm (when N > 10), you should use that.

Use standard library whenever it makes your code shorter; don’t implement everything yourself. External libraries are more problematic, and are both good and bad. With external libraries, such as boost, you can save a lot of work. You should really learn boost, with the added benefit that the c++ standard gets more and more form boost. The negative with boost is that it changes over time, and code that works today may break tomorrow. Also, if you try to combine a third-party library, which uses a specific version of boost, it may break with your current version of boost. This does not happen often, but it may.

Don’t blindly use C++ standard library without understanding what it does - learn it. You look at std::vector::push_back() documentation at it tells you that its complexity is O(1), amortized. What does that mean? How does it work? What are benefits and what are the costs? Same with std::map, and with std::unordered_map. Knowing the difference between these two maps, you’d know when to use each one of them.

Never call new or delete directly, use std::make_unique and [cost c++]std::make_shared[/code] instead. Try to implement usique_ptr, shared_ptr, weak_ptr yourself, in order to understand what they actually do. People do dumb things with these types, since they don’t understand what these pointers are.

Every time you look at a new class or function, in boost or in std, ask yourself “why is it done this way and not another?”. It will help you understand trade-offs in software development, and will help you use the right tool for your job. Don’t be afraid to peek into the source of boost and the std, and try to understand how it works. It will not be easy, at first, but you will learn a lot.

Know what complexity is, and how to calculate it. Avoid exponential and cubic complexity, unless you know your N is very low, and will always stay low.

Learn data-structures and algorithms, and know them. Many people think that it is simply a wasted time, since all data-structures are implemented in standard libraries, but this is not as simple as that. By understanding data-structures, you’d find it easier to pick the right library. Also, believe it or now, after 25 years since I learned data-structures, I still use this knowledge. Half a year ago I had to implemented a hash table, since I needed fast serialization capability which the available libraries did not provide. Now I am writing some sort of interval-btree, since using std::map, for the same purpose, turned up to be very very slow, and the performance bottleneck of my code.

Notice that you can’t just find interval-btree on Wikipedia, or stack-overflow. The closest thing you can find is Interval tree, but it has some performance drawbacks. So how can you implement an interval-btree, unless you know what a btree is and what an interval-tree is? I strongly suggest, again, that you learn and remember data-structures.

These are the most important things, which will make you a better programmer. The other things will follow.

Many of us who have iPhones download every interesting app we find on the App Store, especially when they’re free. They can range from a simple payment method app, to a game, to a measurement tool. But, as you may have noticed, our phones become cluttered with tons of pages that we have to swipe through to get to an app that we need on demand. However, with an update by Apple that came out not so long ago, you are able to group your applications into categories that are easily accessible, for all of you organization lovers.

To achieve this grouping method, take a hold of one of the applications you want to categorize. Take a game for example. What you want to do is press your finger on that particular application, and hold it there until all of the applications on the screen begin to jiggle. This is where the magic happens. Drag it over to another game application you want to have in the same category, and release. Your applications should now be held in a little container on your screen. However, a step ago, if you did not have another game application on the same screen, and since you can’t swipe, try putting the held game application on any application you choose, and simply remove that extra application from the list, after moving over another gaming application from a different page.