ChamanDhattarwal's blog

Which algorithm to use to find the shortest path to get a girlfriend?
By ChamanDhattarwal, 2 years ago, In English

Programmer's version of how to win a girl's heart. Let's propose our coding crushes.

Gather enough courage and open up to a girl here. See what they have to say about it.

  • Vote: I like it
  • +13
  • Vote: I do not like it

Comments Comments (29)
| Write comment?
»
2 years ago, # |
  Vote: I like it -67 Vote: I do not like it

blackhatinside will you be my friend? I've sent you DM please reply

→ Reply
»
2 years ago, # |
  Vote: I like it +183 Vote: I do not like it

This is just a specific case of Dijkstra's algorithm. Write it up and then as input, add 2 nodes. The first node — also the root — is "current state — programmer". and the second node being — "target state — having a girlfriend". Next, notice the lack of edges.

→ Reply
»
2 years ago, # |
  Vote: I like it +10 Vote: I do not like it

I developed a very fast algorithm that can get you a girlfriend in O(N).Here is the paper with the full proof of how it works

→ Reply
»
2 years ago, # |
  Vote: I like it +27 Vote: I do not like it

Straightforward brute force. And after that you will get nothing but an anime waifu.

→ Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Rank push algorithm to get Red. More details here : https://www.youtube.com/watch?v=y7169jEvb-Y

→ Reply
»
2 years ago, # |
  Vote: I like it +25 Vote: I do not like it

KMP = 看毛片 = watch porn (in Chinese)

→ Reply
»
2 years ago, # |
  Vote: I like it +132 Vote: I do not like it

Isn't it NP-hard?

→ Reply
»
2 years ago, # |
  Vote: I like it +66 Vote: I do not like it

DICKstra algorithm

→ Reply
»
2 years ago, # |
  Vote: I like it +8 Vote: I do not like it

https://sort-me.org/tasks/34?archive=1&hidesolved=1&category=0

→ Reply
»
2 years ago, # |
  Vote: I like it +1 Vote: I do not like it

What algorithm do you use to gather confidence to talk to crush?(asking for a friend)

→ Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

I have already got one

→ Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Simply there is no path

→ Reply
»
2 years ago, # |
← Rev. 2   Vote: I like it +7 Vote: I do not like it

There is a book on this topic. The pre-computation is O(n), but the algorithm runs in O(logn). It describes a fast way of getting a girlfriend, but you may have to lower your standards, as looking for the best girl might result in Segmentation fault and the OS will kill your program.

→ Reply
  • »
    »
    2 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Pretty sure, no matter how lower you put your standards, finding a girl will always return a NullPointerException :p

    → Reply
»
2 years ago, # |
  Vote: I like it +3 Vote: I do not like it

Use WFS (Wife First Search)

→ Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Lol, you just need to be yourself

→ Reply