Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon.

Pages: 1-4041-8081-120121-160161-200201-

★ /prog/ challenge No. 666 ★ (Easy)

Name: Anonymous 2013-01-07 12:41

THE CHALLENGE:
Implement ``Tohosort'' (http://www.freewebs.com/tohosort/) 66in Lisp99 in your programming language of choice.

Post the source code of your implementation. It should at least read the input from stdin and print a sorted list after making the comparisons.

Deadline: 2013-01-21 00:00.

The programs will be judged by elegance, speed and number of comparisons made using a random list that will be published the day of the deadline. The winner will be awarded with Ten (10) שקליםSuss (that's Suss-shekels for you goyim), which is enough to pay the fee needed to cross the Sanzu River by ferry.

Name: Anonymous 2013-01-07 12:46

Time to read SICP.

Name: Anonymous 2013-01-07 12:59

May I use Perl?

Name: Anonymous 2013-01-07 13:09

Is this about the underlying algorithm? Then the number of comparisons should be invariant under various implementations.

Name: Anonymous 2013-01-07 15:56

>>4
sepples, PHP and Java(Shit) retards wouldn't get it right. But yes, I think it's just the algorithm.

Name: Anonymous 2013-01-07 18:37

Original code:


function fnc_Sort(int_SelectID) {
   // ステータスにより処理を分岐
   switch (int_Status) {
      case 0:
         // 初回クリック時、ソート情報を初期化する。
         init();
      case 2:
         // ソートが終了していた場合、ソート処理は行わない。
         return;
      default:
   }

   // ary_RecordDataに保存
   // 左側Count
   if (int_SelectID != 1) {
      fnc_CountUp(0);
      while (ary_EqualData[ary_RecordData[int_RecordID-1]] != -1) {
         fnc_CountUp(0);
      }
   }

   // 引き分けの場合のみ
   if (int_SelectID == 0) {
      ary_EqualData[ary_RecordData[int_RecordID-1]] = ary_SortData[int_RightList][int_RightID];
   }

   // 右側Count
   if (int_SelectID != -1) {
      fnc_CountUp(1);
      while (ary_EqualData[ary_RecordData[int_RecordID-1]] != -1) {
         fnc_CountUp(1);
      }
   }

   // 片方のリストを走査し終えた後の処理
   if (int_LeftID < ary_SortData[int_LeftList].length && int_RightID == ary_SortData[int_RightList].length) {
      // リストint_RightListが走査済 - リストint_LeftListの残りをコピー
      while (int_LeftID < ary_SortData[int_LeftList].length){
         fnc_CountUp(0);
      }
   } else if (int_LeftID == ary_SortData[int_LeftList].length && int_RightID < ary_SortData[int_RightList].length) {
      // リストint_LeftListが走査済 - リストint_RightListの残りをコピー
      while (int_RightID < ary_SortData[int_RightList].length){
         fnc_CountUp(1);
      }
   }

   //両方のリストの最後に到達した場合は
   //親リストを更新する
   if (int_LeftID == ary_SortData[int_LeftList].length && int_RightID == ary_SortData[int_RightList].length) {
      for (i=0; i<ary_SortData[int_LeftList].length + ary_SortData[int_RightList].length; i++) {
         ary_SortData[ary_ParentData[int_LeftList]][i] = ary_RecordData[i];
      }

      ary_SortData.pop();
      ary_SortData.pop();
      int_LeftList  = int_LeftList - 2;
      int_RightList = int_RightList - 2;
      int_LeftID    = 0;
      int_RightID   = 0;

      //新しい比較を行う前にary_RecordDataを初期化
      if (int_LeftID == 0 && int_RightID == 0) {
         for (i=0; i<ary_TempData.length; i++) {
            ary_RecordData[i] = 0;
         }
         int_RecordID = 0;
      }
   }

   // 終了チェック
   int_Status = (int_LeftList < 0) ? 2 : 1;

   fnc_ShowData();
}

Made in JavaShit without using trees. I'm sure I can make something better.

Name: Anonymous 2013-01-07 18:38

Oh, forgot to link the code:

http://www.freewebs.com/tohosort/src/fnc_main.js < Sorting function
http://www.freewebs.com/tohosort/src/fnc_data.js < Who the fuck knows

Name: Anonymous 2013-01-07 18:44

I think I'll work out something cute this week.

Name: Anonymous 2013-01-07 18:45

>>8
Let's see how finishes first.

Sadly. I know C but not Lisp. Well, Xarn would always win these challenges without using Lisp. only C and Allegro.

Name: Anonymous 2013-01-07 19:15

>>9
*who, I'm fucking dumb.

Name: Anonymous 2013-01-07 19:15

LELLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLL
EJPIN 2HU THRAD JPROS!
I CANT WAIT 2 MOVE 2 JAPNA!
FIRST I NEED 2 LERN THE LANGUANEG XDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDD
LEL IM SUCH A NEEET XXDDDDDDDDDD
>EJPIN
>EJPIN
>EJPIN
>EJPIN

Name: Anonymous 2013-01-07 19:26

>>11
OP here. The program should receive the list of things you want to compare. That way, you can sort your preferences for fruits, movies or Jewish runes. The Touhou thing is just an example, this is the only ``comparator'' of this kind I know.

Also, no need to act like an imageboard frequenters ironically when you can participate and win the exclusive Suss-shekels.

Name: Anonymous 2013-01-07 19:32

>>11
Rare /jp/ visitor here.

Most of /jp/ are ``such a neet XD'' like you say. But a good bunch of /jp/ knows Japanese and would go to Japan only for touristic purposes. They hate the ``I CANT WAIT 2 MOVE 2 JAPNA!'' crowd, so I don't really understand why you're mocking them like that. They also hate that /b/-style posting you just used. If anything, /g/, /v/ or /a/ are the ones who love that posting style, not them.

Name: Anonymous 2013-01-07 19:38

>>12-13
How about you retards ignore the troll once and for all and stop replying to his Reddit ramblings? He will eventually get tired of it. Trust me, I've been here since before >>11 was born.

Name: Anonymous 2013-01-07 19:46

Hi all, I'm >>11's brother, here to apologize for the inconvenience. You see, >>11 recently escaped from the local senior's leatherman dungeon where he's the resident gimp boy. We're working on apprehending him and returning him to his natural homosexual habitat, so bear with us.

Name: Anonymous 2013-01-07 19:54

>>15
It's funny because you said ``bear'' with us and there are hairy faggots who call themselves bears.

In any case, let's not shit up the thread, I haven't seen a /prog/ challenge in a good while. This may not be as interesting as other challenges but I'll probably give it a try. I really need to ``derust'' my Lisp skills.

Name: Anonymous 2013-01-07 19:59

Sure, it's interesting, but is it Abelson interesting?

Name: Anonymous 2013-01-07 21:49

>>11
hi FFP

Name: Anonymous 2013-01-07 23:24

>LE EJPIN DOUHOU
>I PROGRAMMING WITH LE LITTLE GIRLS LEL
>LE KAWAI
>LLLLLLLLLLLLLLLLLEEEEEEEEEEEEEEEEEELLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLL

Name: Anonymous 2013-01-08 9:46

>>19
hi javashit kike

Name: Anonymous 2013-01-08 10:11

Time changes after your 14th birthday!

Name: Anonymous 2013-01-08 20:34

Dubs check after you look at em!

Name: Anonymous 2013-01-09 3:38

I don't understand what its doing. I'd love to do the contest though. What the fuck does it need to do?

Name: Anonymous 2013-01-09 3:58

Am I missing something or is this some introductory-level shit?

Name: Anonymous 2013-01-09 5:09

Given an unordered set, optimally choose pairs a,b that when given some number of a>b / b>a or b=a equalities, returns an ordered set?

Name: Anonymous 2013-01-09 9:50

>>24
A rather interesting problem is minimizing the amount of comparisons you ask for using prediction. I thought up a few things but I'm too lazy to implement them.

Name: Anonymous 2013-01-09 10:27

>>25 (CC: >>24)
Yes, that's what Tohosort does, although I'm not 100% sure if that's the challenge. Well, it says Easy on the title, so it must be that. >>26's suggestion must be the somewhat interesting part.

Name: Anonymous 2013-01-09 10:32

I'm thinking of a non-deterministic way of doing it. Maybe randomizing the elements in the set would minimize the amount of comparisons made?

I should read my HtDP

Name: Anonymous 2013-01-09 10:38

>>28
"So that the room will be empty."

Name: Anonymous 2013-01-09 10:58

>>28
Or you could just read anything about sorting algorithms. The problem is literally just sorting a list using pairwise comparisons; i.e. the way nearly every sorting does it.
You can store other people's results to create a partly sorted list (and choose a sorting algorithm that works better on partly sorted lists), but even that isn't very interesting.

Name: Anonymous 2013-01-09 11:05

>>30
But the user is the one who gives the result to compare(a, b), not the elements themselves. Every user will have a different way of sorting the set.

Name: Anonymous 2013-01-09 11:14

>>30
You checked the link right?

Name: Anonymous 2013-01-09 11:18

Can I redeem it in riyals instead?

Name: Anonymous 2013-01-09 11:59

>>33
Damn it Nikita.

Name: Anonymous 2013-01-09 14:21

>>31
I don't know why you think that makes even the slightest difference. A comparison is a comparison, whether it's done by a mathematical function or an idiot clicking Chinese cartoon stills.


>>32
Fuck right off.

Name: Anonymous 2013-01-09 16:10

>>35
An idiot clicking Chinese cartoon stills is not a deterministic Turing machine.

Name: Anonymous 2013-01-09 16:11

>>35
Model your average human behavior with a mathematical function.

Name: Anonymous 2013-01-09 16:15

>>35
I don't think you should call people idiots.

Name: Anonymous 2013-01-09 21:02

>>26
You are correct and I salute your satori.

Name: Anonymous 2013-01-09 21:07

2e 80 79 84 f4 c9 87 fc 01 60 fc 0f e5 ac b8 d4

Name: Anonymous 2013-01-09 21:21

>>27,* -bonus challenge- show that #25 |optimally choosing pairs a,b (to compare)| is (or isn't?) equivalent to #26 |minimising the number of comparisons|

Name: Anonymous 2013-01-10 18:38

Found this digging the thread list.

So this means I have to design a function such that f(user) = user preferences with the least complexity possible?

I should re-read Cormen's book.

Name: Anonymous 2013-01-10 18:40

>>42
Found this digging the thread list.
Digging? It's three days old. Get sodomised.

Name: Anonymous 2013-01-10 18:49

>>40 random bullshit, means nothing

Name: Anonymous 2013-01-10 20:01

List of ordered pairs '(a b) representing a > b
Function (trans) that adds pairs to the list according to the transitive property of >
Function (compare a b) that returns #t if '(a b) is in the list and #f if '(b a) is in the list. If neither pair is in the list it asks the user to solve the comparison and adds it to the list.

Plug compare into your favorite comparative sort algorithm for a first try.


This method will produce decent results, but you can do way better. For example starting with a single elimination tournament to get a binary tree to straighten out. I'm guessing an element higher on the list will usually beat one that's lower on the tree. I think this sort of predictive method would minimize the comparisons you need to ask the user.

Another interesting idea is using heuristics to guess preference. Probably the approach I would prefer.

Name: Anonymous 2013-01-10 22:14

>>35-37 lol you guys... just build an nxn table representing a bunch of randomized equalities

Name: Anonymous 2013-01-11 4:33

>>45
I fairly certain that quicksort does this. That is, it has the property that if it performs the query a < b, b < c, with both being true, then a < c is never evaluated by the algorithm. Merge sort might have it to, but that's harder for me to visualize right now.

Name: Anonymous 2013-01-11 12:19

In Ruby. It looks quite fancy -- both the source code (it's remarkably short if you leave out the data) and the interface:

games, touhous = eval DATA.read

selection = case ARGV[0]
  when "-a"
    (0..16).to_a
  when "-c"
    games.each_index.select do |i|
      print "Include games from #{games[i]}? "
      $stdin.gets =~ /y/i
    end
  when '-h'
    puts <<-END
   
    Usage:
      #$0       Sort Touhous from games only
      #$0 -a    Sort all Touhous
      #$0 -c    Custom source selection
      #$0 -h    Show this help
    END
   
    exit
  else
    (0..9).to_a
end

def touhou_cmp(a, b)
  fmt = "\e[31m%30s\e[0m (1) vs. (2) \e[32m%-30s\e[0m ? "
  loop do
    printf fmt, a, b
    case $stdin.gets.chomp
      when "1"; return -1
      when "2"; return  1
    end
  end
end

touhous.reject! { |i| (i[1] & selection).empty? }
puts touhous.map(&:first).sort &method(:touhou_cmp)

__END__
[
  [
    "Embodiment of Scarlet Devil",
    "Perfect Cherry Blossom",
    "Immaterial and Missing Power",
    "Imperishable Night",
    "Phantasmagoria of Flower View",
    "Mountain of Faith",
    "Scarlet Weather Rhapsody",
    "Subterranean Animism",
    "Touhou Hisoutensoku",
    "Undefined Fantastic Object",
    "Books and CDs",
    "The Highly Responsive to Prayers",
    "The Story of Eastern Wonderland",
    "Phantasmagoria of Dim.Dream",
    "Lotus Land Story",
    "Mystic Square",
    "Others",
  ],
  [
    ["Reimu Hakurei",              [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10]],
    ["Marisa Kirisame",            [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10]],
    ["Rumia",                      [0, 10]],
    ["Daiyousei",                  [0, 10]],
    ["Cirno",                      [0, 1, 4, 8, 10]],
    ["Hong Meiling",               [0, 2, 8, 10]],
    ["Koakuma",                    [0, 10]],
    ["Patchouli Knowledge",        [0, 2, 6, 8, 10]],
    ["Sakuya Izayoi",              [0, 1, 2, 3, 4, 6, 8, 10]],
    ["Remilia Scarlet",            [0, 2, 3, 6, 8, 10]],
    ["Flandre Scarlet",            [0, 10]],
    ["Letty Whiterock",            [1, 10]],
    ["Chen",                       [1, 2, 6, 8, 10]],
    ["Alice Margatroid",           [1, 2, 3, 6, 8, 10]],
    ["Shanghai Doll",              [1, 2, 3, 6, 8]],
    ["Hourai Doll",                [1, 2, 3, 6, 8]],
    ["Lily White",                 [1, 4, 10]],
    ["Lunasa Prismriver",          [1, 4, 10]],
    ["Merlin Prismriver",          [1, 4, 10]],
    ["Lyrica Prismriver",          [1, 4, 10]],
    ["Youmu Konpaku",              [1, 2, 3, 4, 6, 8, 10]],
    ["Yuyuko Saigyouji",           [1, 2, 3, 6, 8, 10]],
    ["Ran Yakumo",                 [1, 2, 3, 6, 8, 10]],
    ["Yukari Yakumo",              [1, 2, 3, 6, 8, 10]],
    ["Suika Ibuki",                [2, 6, 8, 10]],
    ["Wriggle Nightbug",           [3, 10]],
    ["Mystia Lorelei",             [3, 4, 10]],
    ["Keine Kamishirasawa",        [3, 10]],
    ["Tewi Inaba",                 [3, 4, 10]],
    ["Reisen Udongein Inaba",      [3, 4, 8, 10]],
    ["Eirin Yagokoro",             [3, 10]],
    ["Kaguya Hoiraisan",           [3, 10]],
    ["Kimo-Keine",                 [3]],
    ["Fujiwara no Mokou",          [3, 10]],
    ["Aya Shameimaru",             [4, 6, 8, 10]],
    ["Medicine Melancholy",        [4, 10]],
    ["Yuka Kazami",                [4, 10]],
    ["Komachi Onozuka",            [4, 6, 8, 10]],
    ["Shikieiki Yamaxanadu",       [4, 10]],
    ["Shizuha Aki",                [5]],
    ["Minoriko Aki",               [5]],
    ["Hina Kagiyama",              [5]],
    ["Nitori Kawashiro",           [5]],
    ["Momiji Inubashiri",          [5]],
    ["Sanae Kochiya",              [5, 7, 8, 9]],
    ["Kanako Yasaka",              [5, 8]],
    ["Suwako Moriya",              [5, 7, 8]],
    ["Iku Nagae",                  [6, 8]],
    ["Tenshi Hinanawi",            [6, 8]],
    ["Edo Explosive Pawn",         [6, 8]],
    ["Kisume",                     [7]],
    ["Yamame Kurodani",            [7]],
    ["Parsee Mizuhashi",           [7]],
    ["Yuugi Hoshiguma",            [7]],
    ["Orin (Cat form)",            [7]],
    ["Satori Komeiji",             [7]],
    ["Rin Kaenbyou (Orin)",        [7]],
    ["Zombie Fairy",               [7]],
    ["Utsuho Reiuji (Okuu)",       [7, 8]],
    ["Koishi Komeiji",             [7]],
    ["Goliath Doll",               [8]],
    ["Great Catfish",              [8]],
    ["Nazrin",                     [9]],
    ["Kogasa Tatara",              [9]],
    ["Ichirin Kumoi",              [9]],
    ["Unzan",                      [9]],
    ["Minamitsu Murasa",           [9]],
    ["Shou Toramaru",              [9]],
    ["Byakuren Hijiri",            [9]],
    ["Nue Houjuu",                 [9]],
    ["Sunny Milk",                 [10]],
    ["Luna Child",                 [10]],
    ["Star Sapphire",              [10]],
    ["Sake Insect",                [10]],
    ["Tsuchinoko",                 [10]],
    ["Giant Toad",                 [10]],
    ["Great Tengu of Miyama",      [10]],
    ["Rain Fairy",                 [10]],
    ["Rinnosuke Morichika",        [10]],
    ["Hieda no Akyu",              [10]],
    ["Tokiko",                     [10]],
    ["Reisen",                     [10]],
    ["Watatsuki no Toyohime",      [10]],
    ["Watatsuki no Yorihime",      [10]],
    ["Maribel Hearn",              [10]],
    ["Renko Usami",                [10]],
    ["Mr. Kirisame",               [10]],
    ["Reimu Hakurei (PC-98)",      [11, 12, 13, 14, 15]],
    ["Yin-Yang Orb",               [11]],
    ["Shingyoku",                  [11]],
    ["YuugenMagan",                [11]],
    ["Elis",                       [11]],
    ["Sariel",                     [11]],
    ["Kikuri",                     [11]],
    ["Konngara",                   [11]],
    ["Genjii",                     [11, 12, 13, 14, 15]],
    ["Rika",                       [12]],
    ["Meira",                      [12]],
    ["Marisa Kirisame (PC-98)",    [12, 13, 14, 15]],
    ["Mima",                       [11, 12, 13, 15]],
    ["Ellen",                      [13]],
    ["Kotohime",                   [13]],
    ["Kana Anaberal",              [13]],
    ["Rikako Asakura",             [13]],
    ["Chiyuri Kitashirakawa",      [13]],
    ["Yumemi Okazaki",             [13]],
    ["Ruukoto",                    [13]],
    ["Mimi-chan",                  [13]],
    ["Orange",                     [14]],
    ["Kurumi",                     [14]],
    ["Elly",                       [14]],
    ["Yuka (PC-98)",               [14, 15]],
    ["Mugetu",                     [14]],
    ["Gengetu",                    [14]],
    ["Sara",                       [15]],
    ["Luize",                      [15]],
    ["Alice",                      [15]],
    ["Yuki",                       [15]],
    ["Mai",                        [15]],
    ["Yumeko",                     [15]],
    ["Shinki",                     [15]],
    ["Lily Black",                 [4, 16]],
    ["Scarlet Devil Mansion Maid", [16]],
    ["Eientei Rabbit",             [16]],
    ["Leila Prismriver",           [16]],
    ["Youki Konpaku",              [16]],
    ["Fluff Ball",                 [16]],
  ]
]

Name: Anonymous 2013-01-11 13:14

>>48
I bet this is SLOW AS BALLS.

Name: Anonymous 2013-01-11 13:16

>>45
You have read your SICP. Good goy.

Name: Anonymous 2013-01-12 21:12

I wonder if it's possible to minimize both the comparisons and the ties. You people don't seem to be taking that into account.

Name: Anonymous 2013-01-13 1:03


(format t "Enter a list of all tohou: ")
(defvar *tohou* (read))
(defvar *sorted-tohou* (sort *tohou* (lambda (tohou1 tohou2)
  (format t "Is ~A better than ~A? " tohou1 tohou2)
  (case (read)
    ((yes y) t)
    (t nil)))))
(format t "Here's your list: ~A~%" *sorted-tohou*)

Name: Anonymous 2013-01-13 7:39

>>52
Wow shit nigger, learn lisp

Name: >>45 2013-01-13 15:33

>>51
Whenever a tie happens between a and b in a comparison, we can treat them as a single entity '(a b). Just go an replace all references with the pair and keep going.

Name: Anonymous 2013-01-16 17:51

JEWHU

Name: Anonymous 2013-01-16 17:55

this jew meme is getting old

Name: Anonymous 2013-01-16 18:18

>>56
Sure, it's getting old, but is it getting Abelson old?

Name: Anonymous 2013-01-16 19:35

>>56
Your mom is getting old, fagshit.

Name: Anonymous 2013-01-16 19:49

TIL ppl still think /prog/er can actually do more then BBC

Name: Anonymous 2013-01-16 20:10

>>56

meme-sponging tryhard detected

Name: Anonymous 2013-01-16 20:48

>>59
TIL
I feel ashamed to know this is from Reddit, but still, back to Reddit, please.

Name: Anonymous 2013-01-16 20:48

>>60
fuck u faggot

Name: Anonymous 2013-01-17 0:27

>>53
It works in case you were wondering. Optimality depends on the implementation of sort.

It you want to minimize comparisons in the worst case, just use merge sort. I've heard that it isn't quite exactly the optimal but it's the closest out of all the basic ones.

Name: Anonymous 2013-01-17 14:20

Splitting into four posts since it was too large and I don't know the max post length.
#include <ctype.h>
#include <locale.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>

#define    PC98        0xf8000000
#define HRtP        0x80000000
#define STG        0x7fff0000
#define PC98_STG    0x78000000
#define SoEW        0x40000000
#define LLS        0x20000000
#define MS        0x10000000
#define PHANTASMAGORIA    0x0c000000
#define PoDD        0x08000000
#define WINDOWS     0x07fff000
#define WINDOWS_STG    0x07ff0000
#define PoFV        0x04000000
#define EoSD        0x02000000
#define PCB        0x01000000
#define IN        0x00800000
#define MoF        0x00400000
#define SA        0x00200000
#define UFO        0x00100000
#define FW        0x00080000
#define TD        0x00040000
#define AYA_GAMES    0x00030000
#define StB        0x00020000
#define DS        0x00010000
#define FIGHTER        0x0000f000
#define IaMP        0x00008000
#define SWR        0x00004000
#define SOKU        0x00002000
#define HM        0X00001000
#define MUSIC        0x00000e00
#define ZUN_MUSIC_COL    0x00000c00
#define DiPP        0x00000800
#define GFC        0x00000400
#define AUS        0x00000200
#define PRINT_WORKS    0x000001ff
#define COMICS        0x000001f4
#define KOURINDOU    0x00000100
#define MOON_WORKS    0x00000080
#define FAIRY_WORKS    0x00000040
#define WaHH        0x00000020
#define FS        0x00000010
#define LORE        0x0000000f
#define BAiJR        0x00000008
#define PMiSS        0x00000004
#define GoM        0x00000002
#define SoPM        0x00000001
#define REIMU        0xfffdfbff
#define MARI        0x7ffdfbff
#define PATCHY        0x07a2f0fe
#define REMI        0x07c2d0df
#define AYA        0x046b41ef
#define YUKARI        0x01a2d1fe
#define PADS        0x0782f0de
#define YUYU        0x0586c0ef
#define YOUMU        0x0586c1cf
#define ALICE        0x11a260fe
#define CIRNO        0x070a20ef
#define SUIKA        0x0023c0fe
#define RAN        0x0182d0de
#define CHEN        RAN
#define SUWAKO        0x007120e3
#define KANAKO        SUWAKO
#define SANAE        0x007520a3
#define NITORI        0x006100f3
#define FLANDRE        0x028200de
#define TEI        0x048200de
#define HONG        0x0202a0ce
#define EIRIN        0x048240ce
#define UDONGE        EIRIN
#define KOMACHI        0x040240f6
#define LUNA        0x000811fc
#define MYSTIA        0x048000e7
#define NAZRIN        0x00111073
#define OKUU        0x00312063
#define NUE        0x00151071
#define STAR        0x000811dc
#define SUNNY        STAR
#define LILY        0x050c10c4
#define AKI        0x004100d3
#define HINA        AKI
#define KUMOI        0x00911071
#define KEINE        0x008200ce
#define WRIGGLE        KEINE
#define MOKOU        KEINE
#define KAGUYA        KEINE
#define LETTY        0x010200ce
#define RUMIA        0x020200ce
#define PRISM        0x0500108e
#define YUUKA        0x3c0008c4
#define KISUME        0x00210053
#define TENSHI        0x00014063
#define YUUGI        0x00210063
#define PARSEE        YUUGI
#define KOMEIJI        YUUGI
#define MURASA        0x00111061
#define KOGASA        0x00150061
#define YAMA        0x040200c6
#define MIMA        0xd8000a00
#define ORIN        0x00210043
#define YAMAME        ORIN
#define SHOU        0x00110061
#define MOMIJI        0x00410061
#define UNZAN        0x00111041
#define MEDI        0x04020086
#define IKU        0x00014003
#define SEIGA        0x00040031
#define YOSHIKA        SEIGA
#define MAMIZOU        SEIGA
#define HATATE        0x00010061
#define HIJIRI        0x00110041
#define GENJI        PC98_STG
#define SHANGHAI    0x01008000
#define AKYU        0x00000205
#define FUTO        0x00040011
#define KYOUKO        0x00040021
#define RINNOSUKE    0x0000010c
#define DAICHAN        0x02080040
#define MIKO        0x00040001
#define TOJIKO        MIKO
#define KASEN        0x00000060
#define KOA        0x02000040
#define HOURAI        0x0180c000
#define AYA_CROW    0x08004000
#define EVIL_EYE    0x60000000
#define FAIRY_MAID    0x020011c0
#define BAKEBAKE    0x78000040
#define HAIRBALL    0x03c00000
#define ZOMBIE_FAIRY    0x00210002
#define SUNFLOWER_FAIRY    0x04780000

typedef struct th th;
struct th {
    unsigned char _;
#define UNKNOWN     0x01
    const uint32_t app;
    const char *const name;
    th *tie;
    th *win;
    th *pre;
};

typedef struct {
    th *btm;
    th *top;
} thls;

#define _2HU(x,y)   {0,x,y}
#define NHU(x,y)    _2HU(x,"Nameless "y)
#define UHU(x,y)    _2HU(x,"Unnamed "y)
#define NM(x,y)     NHU(x,"Midboss "y)
#define PHU(x)      _2HU(PRISM,x" Prismriver")
#define KHU(x)      _2HU(KOMEIJI,x" Komeiji")
#define MHU(x)      _2HU(MOON_WORKS,x)
#define WHU(x)      MHU("Watatsuki no "x)
#define _PoDD(x)    _2HU(PoDD,x)
#define _MS(x)      _2HU(MS,x)
#define _LLS(x)     _2HU(LLS,x)
#define _SoEW(x)    _2HU(SoEW,x)
#define _HRtP(x)    _2HU(HRtP,x)
#define _GFC(x)     _2HU(GFC,x)
#define _AKI(x)     _2HU(AKI,x" Aki")

Name: Anonymous 2013-01-17 14:21

static th ths[] =
{
    _2HU(REIMU, "Reimu Hakurei"),    _2HU(MARI, "Marisa Kirisame"),
    _2HU(PATCHY, "Patchouli Knowledge"),
    _2HU(REMI, "Remilia Scarlet"),    _2HU(AYA, "Aya Shameimaru"),
    _2HU(YUKARI, "Yukari Yakumo"),    _2HU(PADS, "Sakuya Izayoi"),
    _2HU(YUYU, "Yuyuko Saigyouji"),    _2HU(YOUMU, "Youmu Konpaku"),
    _2HU(ALICE, "Alice Margatroid"),
    _2HU(CIRNO, "Cirno"),
    _2HU(SUIKA, "Suika Ibuki"),    _2HU(RAN, "Ran Yakumo"),
    _2HU(CHEN, "Chen"),        _2HU(SUWAKO, "Suwako Moriya"),
    _2HU(KANAKO, "Kanako Yasaka"),    _2HU(SANAE, "Sanae Kochiya"),
    _2HU(NITORI, "Nitori Kawashiro"),
    _2HU(FLANDRE, "Flandre Scarlet"),
    _2HU(TEI, "Inaba Tei"),        _2HU(HONG, "Hong Meiling"),
    _2HU(EIRIN, "Eirin Yagokoro"),    _2HU(UDONGE, "Reisen Udongein Inaba"),
    _2HU(KOMACHI, "Komachi Onozuka"),
    _2HU(LUNA, "Luna Child"),
    _2HU(MYSTIA, "Mystia Lorelei"),    _2HU(NAZRIN, "Nazrin"),
    _2HU(OKUU, "Utsuho Reiuji"),    _2HU(NUE, "Nue Houjuu"),
    _2HU(STAR, "Star Sapphire"),    _2HU(SUNNY, "Sunny Milk"),
    _2HU(LILY, "Lily White"),    _AKI("Shizuha"),
    _AKI("Minoriko"),        _2HU(HINA, "Hina Kagiyama"),
    _2HU(KUMOI, "Ichirin Kumoi"),    _2HU(WRIGGLE, "Wriggle Nightbug"),
    _2HU(MOKOU, "Fujiwara no Mokou"),
    _2HU(KAGUYA, "Kaguya Houraisan"),
    _2HU(KEINE, "Keine Kamishirasawa"),
    _2HU(LETTY, "Letty Whiterock"),    _2HU(RUMIA, "Rumia"),
    PHU("Lunasa"),            PHU("Lyrica"),
    PHU("Merlin"),            _2HU(YUUKA, "Yuuka Kazami"),
    _2HU(KISUME, "Kisume"),        _2HU(TENSHI, "Tenshi Hinanawi"),
    _2HU(PARSEE, "Parsee Mizuhashi"),
    _2HU(YUUGI, "Yuugi Hoshiguma"),    KHU("Satori"), KHU("Koishi"),
    _2HU(MURASA, "Minamitsu Murasa"),
    _2HU(KOGASA, "Kogasa Tatara"),    _2HU(YAMA, "Eiki Shiki Yamaxanadu"),
    _2HU(MIMA, "Mima"),        _2HU(YAMAME, "Yamame Kurodani"),
    _2HU(ORIN, "Rin Kaenbyou"),    _2HU(SHOU, "Shou Toramaru"),
    _2HU(MOMIJI, "Momiji Inubashiri"),
    _2HU(UNZAN, "Unzan"),        _2HU(MEDI, "Medicine Melancholy"),
    _2HU(IKU, "Iku Nagae"),        _2HU(YOSHIKA, "Yoshika Miyako"),
    _2HU(SEIGA, "Seiga Kaku"),    _2HU(MAMIZOU, "Mamizou Futatsuiwa"),
    _2HU(HATATE, "Hatate Himekaidou"),
    _2HU(HIJIRI, "Byakuren Hijiri"),
    _2HU(GENJI, "Genji"),        _2HU(SHANGHAI, "Shanghai"),
    _2HU(AKYU, "Hieda no Akyu"),    _2HU(FUTO, "Mononobe no Futo"),
    _2HU(KYOUKO, "Kyouko Kasodani"),
    _2HU(RINNOSUKE, "Rinnosuke Morichika"),
    _2HU(DAICHAN, "Daiyousei"),    _2HU(TOJIKO, "Soga no Tojiko"),
    _2HU(MIKO, "Toyosatomimi no Miko"),
    _2HU(KASEN, "Ibara Kasen"),    _2HU(KOA, "Koakuma"),
    _2HU(HOURAI, "Hourai"),        _2HU(SOKU, "Goliath Doll"),
    _2HU(FS, "Kosuzu Motoori"),    MHU("Reisen 2"),
    WHU("Toyohime"),        WHU("Yorihime"),
    _PoDD("Ellen"),            _PoDD("Kotohime"),
    _PoDD("Kana"),            _PoDD("Rikako"),
    _PoDD("Chiyuri"),        _PoDD("Yumemi"),
    _PoDD("Ruukoto"),        _MS("Sara"),
    _MS("Louise"),            _MS("Yuki"),
    _MS("Mai"),            _MS("Yumeko"),
    _MS("Shinki"),            _LLS("Orange"),
    _LLS("Kurumi"),            _LLS("Elly"),
    _LLS("Mugetsu"),        _LLS("Gengetsu"),
    _SoEW("Rika"),            _SoEW("Flower Tank"),
    _SoEW("Evil Eye Sigma"),    _SoEW("Meira"),
    _HRtP("Shingyoku"),        _HRtP("Yuugen Magan"),
    _HRtP("Elis"),            _HRtP("Sariel"),
    _HRtP("Kikuri"),        _HRtP("Konngara"),
    _GFC("Renko Usami"),        _GFC("Maribel Hearn"),
    _2HU(EoSD, "Rin Satsuki"),    _2HU(KOURINDOU, "`Tokiko'"),
    NM(SoEW, "Tank"),        _SoEW("`Noroiko'"),
    NM(SoEW, "Magic Things"),    NM(SoEW, "Angel"),
    NHU(LLS, "Flower"),        _LLS("Magic Mirror (Demon)"),
    _MS("Magic Mirror (Angel)"),    NM(LLS, "Ball of light"),
    NM(MS, "Card"),            NM(TD, "Divine Spirit"),
    NM(LLS, "Fairy(?)"),        NM(MS, "Demon"),
    UHU(DiPP, "girl on DiPP Jacket"),
    UHU(WaHH, "Dragon"),        _2HU(PMiSS, "Dragon God"),
    /* stage chara */
    _2HU(FAIRY_MAID, "Fairy Maid"),    _2HU(EVIL_EYE, "Evil Eye"),
    _SoEW("Five Magic Stones"),    _2HU(HAIRBALL, "Hairball"),
    _PoDD("Hoshizako"),        _2HU(BAKEBAKE, "Bakebake"),
    _2HU(SUNFLOWER_FAIRY, "Sunflower Fairy"),
    _2HU(ZOMBIE_FAIRY, "Zombie Fairy"),
    /* weapons chara */
    _PoDD("Mimi-chan"),
    /* animals */
    _2HU(SOKU, "Giant Catfish"),    _2HU(BAiJR, "Giant Toad"),
    _2HU(WaHH, "Unnamed Dapeng"),    _2HU(MOON_WORKS, "Sake bug"),
    /* pets */
    _2HU(AYA_CROW, "Aya's Crow"),    _MS("Alice's Cat"),
    _PoDD("Sokrates"),        _2HU(FAIRY_WORKS, "Tsuchinoko"),
    UHU(WaHH, "Raijuu"),        _2HU(WaHH, "Kanda"),
    _2HU(WaHH, "Kume")
};

Name: Anonymous 2013-01-17 14:21

static thls ls;
static size_t thlen = (sizeof(ths) / sizeof(th));

#define SETB(x, b)  (x |= b)
#define ISB(x, b)   (x & b)
#define ISU(x)      ISB(x->_, UNKNOWN)

static __inline int
select_(void)
{
    int selection = 0;
    int i = scanf("%d", &selection);
    if(i == 1) return selection;
    else if(i == EOF)  printf("scanf eofuk'd; no 2hus for you\n"), abort();
    return -1;
}

#define NEWL(e)    ls.btm = e, ls.top = e

static __inline void
pushb(th *t)
{
    if(ls.btm != NULL) t->pre = ls.top, ls.top = t;
    else NEWL(t);
}

static __inline void
pushf(th *t)
{
    if(ls.btm != NULL) ls.btm->pre = t, ls.btm = t;
    else NEWL(t);
}

#define WIN_(w,l)   w->win = l
#define TIE_(t,x)   t->tie = x

static __inline void
addt(th **a, th *b)
{
    th *t = (*a);
    for(; t->tie != NULL; t = t->tie);
    TIE_(t, b), b->win = NULL;
}

static __inline void
pushu(th *t)
{
    if(ls.btm != NULL)
    {
        if(ISU(ls.btm)) addt(&ls.btm, t);
    }
    else SETB(t->_, UNKNOWN), pushf(t);
}


#define USTR        "\n0 - Both are unknown"
#define THSTR        "\n1 - %s\n2 - %s"
#define TIESTR        "\n3 - Tie"
#define U2STR        "\n4 - Don't know %s\n5 - Don't know %s\n"

#define PRIN2HU(x,y)    printf(THSTR TIESTR "\n:", x->name, y->name)
#define PRINTUHU(x,y)    printf(USTR THSTR TIESTR U2STR ":",\
                x->name, y->name, x->name, y->name)

static void
dicksort(void)
{
    th *n1, *n2, *pw;
    if(ISU(ls.top)) return;
    while((ls.top->pre != NULL) && !ISU(ls.top->pre))
    {
        pw = NULL, n1 = ls.top, n2 = n1->pre;
        ls.top->pre = n2->pre, n2->pre = NULL;
    INNERLOOP:
        PRIN2HU(n1, n2);
        switch(select_()) {
        case 1:
            pw = n1;
            n1 = n1->win;
            if(!n1)
            {
                WIN_(pw, n2);
                continue;
            }
            goto INNERLOOP;
        case 2:
        {
            th *ne = n2->win;
            if(n1 == ls.top)
            {
                n2->pre = ls.top->pre;
                ls.top->pre = NULL;
                ls.top = n2;
            }
            else
                pw->win = n2;
            WIN_(n2, n1);
            if(ne == NULL)
                continue;
            pw = n2;
            n2 = ne;
            goto INNERLOOP;
        }
        case 3:
        {
            th *ne = n2->win, *te = n1->win;
            addt(&n1, n2);
            pw = n1;
            n1 = te, n2 = ne;
            if(n1 == NULL && n2 == NULL)
                continue;
            else if(n1 == NULL)
            {
                pw->win = n2;
                continue;
            }
            else if(n2 == NULL)
            {
                pw->win = n1;
                continue;
            }
            else
                goto INNERLOOP;
        }
        default:
            goto INNERLOOP;
        }
    }
}

static void
list(th *th1, th *th2)
{
    while(1)
    {
        PRINTUHU(th1, th2);
        switch(select_()) {
        case 0: TIE_(th1, th2); pushu(th1); return;
        case 1: WIN_(th1, th2); pushb(th1); return;
        case 2: WIN_(th2, th1); pushb(th2); return;
        case 3: TIE_(th1, th2); pushb(th1); return;
        case 4: pushu(th1);    pushb(th2); return;
        case 5: pushu(th2);    pushb(th1); return;
        default: continue;
        }
    }
}

#define FOPT "Filter options:\n"
#define FR1  "\t 0 - ALL\t 1 - HRtP\t 2 - SoEW\t 3 - PoDD\n"
#define FR2  "\t 4 - LLS\t 5 - MS\t\t 6 - EoSD\t 7 - PCB\n"
#define FR3  "\t 8 - IN\t\t 9 - PoFV\t10 - MoF\t11 - SA\n"
#define FR4  "\t12 - UFO\t13 - TD\t\t14 - StB\t15 - DS\n"
#define FR5  "\t16 - FW\t\t17 - IaMP\t18 - SWR\t19 - SOKU\n"
#define FR6  "\t20 - HM\t\t21 - PC98\t22 - STG\t23 - PC98 STG\n"
#define FR7  "\t24 - PHANTASM\t25 - Windows\t26 - WIN STG\t27 - Fighter\n"
#define FR8  "\t28 - Aya games\n\t29 - Music\t30 - DiPP\t31 - GFC\n"
#define FR9  "\t32 - ZUN music\t33 - Akyu Untouched\n\t34 - Print\t35 - Manga\n"
#define FR10 "\t36 - Kourindou\t37 - Bougetsu\t38 - Sangetsu\t39 - Ibarakasen\n"
#define FR11 "\t40 - Suzunaan\t41 - Lore\t42 - BAiJR/SDV\t43 - PMiSS\n"
#define FR12 "\t44 - Grimoire\t45 - Symposium\n"
#define FDOPT "default: ALL\n:"
#define FOPSTR FOPT FR1 FR2 FR3 FR4 FR5 FR6 FR7 FR8 FR9 FR10 FR11 FR12 FDOPT

Name: Anonymous 2013-01-17 14:21

static uint32_t
getbits(void)
{
    uint32_t i, ret;
    char buf[3], c;
    buf[2] = 0, i = 0, ret = 0;
    printf(FOPSTR);
    while((c = getc(stdin)) != EOF)
    {
        if(isdigit(c))
        {
            if(i > 1) printf("2 digits motherfucker!\n"), abort();
            buf[i++] = c;
        }
        else if(isspace(c))
        {
            switch(atoi(buf)) {
            case 1: SETB(ret, HRtP);        break;
            case 2: SETB(ret, SoEW);        break;
            case 3: SETB(ret, PoDD);        break;
            case 4: SETB(ret, LLS);            break;
            case 5: SETB(ret, MS);            break;
            case 6: SETB(ret, EoSD);        break;
            case 7: SETB(ret, PCB);            break;
            case 8: SETB(ret, IN);            break;
            case 9: SETB(ret, PoFV);        break;
            case 10: SETB(ret, MoF);        break;
            case 11: SETB(ret, SA);            break;
            case 12: SETB(ret, UFO);        break;
            case 13: SETB(ret, TD);            break;
            case 14: SETB(ret, StB);        break;
            case 15: SETB(ret, DS);            break;
            case 16: SETB(ret, FW);            break;
            case 17: SETB(ret, IaMP);        break;
            case 18: SETB(ret, SWR);        break;
            case 19: SETB(ret, SOKU);        break;
            case 20: SETB(ret, HM);            break;
            case 21: SETB(ret, PC98);        break;
            case 22: SETB(ret, STG);        break;
            case 23: SETB(ret, PC98_STG);        break;
            case 24: SETB(ret, PHANTASMAGORIA);    break;
            case 25: SETB(ret, WINDOWS);        break;
            case 26: SETB(ret, WINDOWS_STG);    break;
            case 27: SETB(ret, FIGHTER);        break;
            case 28: SETB(ret, AYA_GAMES);        break;
            case 29: SETB(ret, MUSIC);        break;
            case 30: SETB(ret, DiPP);        break;
            case 31: SETB(ret, GFC);        break;
            case 32: SETB(ret, ZUN_MUSIC_COL);    break;
            case 33: SETB(ret, AUS);        break;
            case 34: SETB(ret, PRINT_WORKS);    break;
            case 35: SETB(ret, COMICS);        break;
            case 36: SETB(ret, KOURINDOU);        break;
            case 37: SETB(ret, MOON_WORKS);        break;
            case 38: SETB(ret, FAIRY_WORKS);    break;
            case 39: SETB(ret, WaHH);        break;
            case 40: SETB(ret, FS);            break;
            case 41: SETB(ret, LORE);        break;
            case 42: SETB(ret, BAiJR);        break;
            case 43: SETB(ret, PMiSS);        break;
            case 44: SETB(ret, GoM);        break;
            case 45: SETB(ret, SoPM);        break;
            default: return 0;
            }
            buf[0] = 0;
            buf[1] = 0;
            i = 0;
            if(c == '\n') break;
        }
        else return 0;
    }
    return ret;
}

static __inline void
printties(th *t, int i)
{
    while(t != NULL) printf("%3d: %s\n", i, t->name), t = t->tie;
}

#define PRINTSLW(t,i)    printf("%3d: %s\n", i, t->name)

static void
printls(void)
{
    printf("\n\n+++\n");
    th *l, *t;
    int i;
    for(i = 1, l = ls.top , t = l ;t != NULL; l = l->pre, t = l)
    {
        if(ISU(t))
        {
            printties(t, -1);
            break;
        }
        else
        {
            while(t != NULL)
            {
                if(t->tie != NULL) printties(t, i);
                else PRINTSLW(t,i);
                t = t->win;
                i++;
            }
        }
    }
    printf("+++\n\n");
}

#define APPLY_FILTER_INNER(flt,t,i)\
for(;i < thlen;)\
{\
    if(ISB(ths[i].app, flt))\
    {\
        list(t, &ths[i++]);\
        t = NULL;\
        break;\
    }\
    else i++;\
}

#define APPLY_FILTER(flt)    \
th * t;\
int i;\
for(i = 0; i< thlen;)\
{\
    if(ISB(ths[i].app, flt))\
    {\
        t = &ths[i++];\
        APPLY_FILTER_INNER(flt,t,i);\
    }\
    else i++;\
}\
if(t != NULL) pushb(t);\

int
main(void)
{
    setlocale(LC_ALL, "C");
    uint32_t flt;
    flt = getbits();
    if(flt)
    {
        APPLY_FILTER(flt);
    }
    else
    {
        int i = 0, j = 1;
        for(; i < thlen && j < thlen; i += 2, j += 2)
            list(&ths[j], &ths[i]);
        if(j == thlen) pushb(&ths[i]);
    }
    dicksort();
    printls();
    return EXIT_SUCCESS;
}

Name: Anonymous 2013-01-17 14:28

>>67
Get an unsigned long up your anus, you dirty man.

Name: Anonymous 2013-01-17 14:32

Like ants through the hour glass, so are the days of our cats. With ham in our soup, so are the mice of our rats.

Name: Anonymous 2013-01-17 15:03

>>64
Your ``bitmasks'' and your
#define UDONGE        EIRIN
crack me up.

Name: Anonymous 2013-01-17 15:08

Guys, this can be implemented with a while(!finished) and a tree traversal. What the fuck are you nigger kikes doing?

Name: Anonymous 2013-01-17 15:19

>>70
The `bitmask' represent each chara's appearance which I'm using as a filter. I got them from the wiki (and fit them together into 32 bits), so they may not be accurate.

Name: Anonymous 2013-01-17 16:15

http://upload.wikimedia.org/wikipedia/commons/d/d0/Kiryat_Mal%27achi_religious_dudes.jpg

NIGGER KIKES

Name: Anonymous 2013-01-17 16:16

I'm tired of /prog/. The JEWS stuff has really ruined it for me.

Name: Anonymous 2013-01-17 16:30

>>74
Rewrite a new /prog/ ``in Lisp'' that supports Sexpcode and requires a basic programming test to get in for the first time but remains to be anonymous. I'll give you free web hosting if you do it.

Name: Anonymous 2013-01-17 21:49

Quick question, are we allowed to use libraries such as Rhino to do this?

Name: Anonymous 2013-01-17 22:02

>>76
The fuck is Rhino?

Name: Anonymous 2013-01-17 22:47

>>75
free hosting

Really? I may take you up on that then.

But in all honesty this prog, with all of its crap, is better than any regulated prog could be.

Name: Anonymous 2013-01-17 22:53

>>78
It would be cool if we had a system to subscribe to a (cryptographically-signed) post blacklist, not unlike adblock. That way a person could flag all the antijew spam and other people wouldn't get to see it. I'd implement it, but I'm too lazy and prog is a shitty software foundation for anything

Name: Anonymous 2013-01-17 23:29

>>79
//    This program is free software: you can redistribute it and/or modify
//    it under the terms of the GNU General Public License as published by
//    the Free Software Foundation, either version 3 of the License, or
//    (at your option) any later version.
//
//    This program is distributed in the hope that it will be useful,
//    but WITHOUT ANY WARRANTY; without even the implied warranty of
//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
//    GNU General Public License for more details.

//    You should have received a copy of the GNU General Public License
//    along with this program.  If not, see <http://www.gnu.org/licenses/>;.
   
function removeShitspam(elements, fnRemove, filterWords) {
    for(var i = 0; i < elements.length; ++i) {
        for(var j = 0; j < filterWords.length; ++j) {       
            if(new RegExp(filterWords[j], "gi").test(elements[i].innerHTML)) {
                fnRemove(elements, i);
            }
        }
    }
}

(function() {
    var oddPosts = document.getElementsByClassName("post odd");
    var evenPosts = document.getElementsByClassName("post even");
    var threads = document.getElementsByClassName("thread");
   
    var filterWords = [
        "jew",
        "ahmed",
        "shalom",
        "kike",
        "e/g/in",
        "javashit",
        "leah"
    ];

    removeShitspam(oddPosts, function(e, i) {
        e[i].style.display = "none";
    }, filterWords);

    removeShitspam(evenPosts, function(e, i) {
        e[i].style.display = "none";
    }, filterWords);   

    removeShitspam(threads, function(e, i) {
        e[i].parentNode.style.display = "none";
    }, filterWords);
})();

Name: Anonymous 2013-01-17 23:47

>>80
S h a l o m    J e w !

Name: Anonymous 2013-01-17 23:48

>>64-67

C is an art.

Name: Anonymous 2013-01-18 0:53

>>80
javackmedjooshitkaik/g/inleeschalom

Name: Anonymous 2013-01-18 8:43

>>80
Fuck off, Javashit kike.

Name: Anonymous 2013-01-18 8:48

_2HU(PADS, "Sakuya Izayoi"),
lel

Name: Anonymous 2013-01-18 14:02

>>82
C is an art.
Yeah. Jewish painter, Lena Hades, makes similar art. For example, out of hatred for Russians, this Jewess drawn Russian alphabet with her own stale shit:
http://pravoedelo1.livejournal.com/86639.html

Name: Anonymous 2013-01-18 14:14

>>86
The C-4 store is two blocks away, Mohammad Al-Salamin.

Name: Anonymous 2013-01-18 14:20

>>87
Shalom, Hymie!

Name: Anonymous 2013-01-18 14:26

>>88
Salam, Shitskin!

Name: Anonymous 2013-01-18 14:52

>>86-89
Tsk.

Name: Anonymous 2013-01-18 15:08

>>90
Nigger.

Name: Anonymous 2013-01-18 15:40

>>91
Tsk.

Name: Anonymous 2013-01-18 16:12

>>92
Person of African descent.

Name: Anonymous 2013-01-19 23:04

Look what I found:
http://xomnom.com/preference.html

Basically, Tohosort, except you can sort anything you want. No Tie/Both are unknown to me options, though.

Now improve it NIGGERS.

Name: Anonymous 2013-01-19 23:08

>>94
Tsk:

Inspired by Tōhō Sort.
Hat tip to pluffei for suggesting a general-purpose version.
Many thanks to Knuth for his in-depth discussion of minimal-comparison sorting.

Unlike Tōhō Sort, which uses merge sort, Preference Revealer uses the Ford-Johnson algorithm, a.k.a. merge insertion, as described in Knuth's The Art of Computer Programming, vol. 3: Sorting and Searching. Read more here.


　 ∧＿∧　　　∧＿∧　　　∧＿∧　　 ∧＿∧　 　 　　∧＿∧
　（　・∀・） 　 （　｀ー´）　　（　´∀｀）　 （　ﾟ ∀ﾟ ）　　　 （　＾∀＾）
　（　　　　つ┳∪━━∪━∪━━∪━∪━∪━┳⊂　 　 　つ
　｜ ｜　|　 ┃This thread has peacefully ended.┃　｜ ｜ ｜
　（_＿）＿） ┻━━━━━━━━━━━━━━┻　（_＿）＿）　　　　　

Name: Anonymous 2013-01-19 23:26

restoring...

Name: Anonymous 2013-01-20 9:05

>>95
The Ford-Johnson Sorting Algorithm Is Not Optimal
http://dl.acm.org/citation.cfm?id=322145

THREAD RESUMED

Name: Anonymous 2013-01-20 9:20

>>97
An abstract is not available.
Piece of crap article.

Name: Anonymous 2013-01-20 9:22

NEW CHALLENGE:

Get a PDF of the paper in >>97.

Name: Anonymous 2013-01-20 9:30

here's a thread I did not miss

Name: Anonymous 2013-01-20 9:33

>>97
http://link.springer.com/article/10.1007%2FBF01934989
Abstract
For almost twenty years, the Ford-Johnson algorithm for sortingt items using comparisons was believed to be optimal. Recently, Manacher was able to show that the Ford-Johnson algorithm is not optimal for certain ranges of values oft. In this paper, we present some new algorithms which achieve much stronger results compared to Manacher's algorithms.

Name: Anonymous 2013-01-20 9:51

>>101
I win:
http://i.minus.com/1358779903/tNJID0hXPNkBU4oj8EC6sA/dSK30Z4PZHAEY/10.1.1.84.1540.pdf

Name: Anonymous 2013-01-20 10:18

>>100
L'Chayim!

Name: Anonymous 2013-01-20 11:44

>>102
8 views
Well that's me, Sussman and you accounted for, but who else?
Ahmed? Benjamin? Shanley? Xarn? FFP? Labiah Culverin?

Name: Anonymous 2013-01-20 12:18

>>104
FrozenVoid, Yannick, Krueger, Xarn and Benito.

Name: Anonymous 2013-01-20 14:12

>>104-105
Xarn doesn't /prog/ anymore. He wrote world4search for /lounge/.

Name: Anonymous 2013-01-20 14:13

>>106
what the fuck man, seriously?

Name: Anonymous 2013-01-20 16:01

>>106
I can't even locate this thread using world4search.

Name: Anonymous 2013-01-20 16:03

>>106
If he wrote it for /lounge/, then why does it have an Anticudder on the background?

Name: Anonymous 2013-01-20 16:08

>>108
http://world4search.no-ip.org:8080/q/prog/tohosort+Suss-shekels

>>109
It only does if you search /prog/. Other boards don't have anything.

Name: Anonymous 2013-01-20 16:28

>>110
It doesn't search titles? Piece of shit.

Name: Anonymous 2013-01-21 8:13

So, who won?

Name: Anonymous 2013-01-21 10:21

>>112
I vote 52-kun.

Name: Anonymous 2013-01-28 21:11

WHO THE FUCK WON

Name: Anonymous 2013-01-28 21:12

>>52
OH YES THIS NIGGA GETS THE JEWGOLDS

Name: Anonymous 2013-01-28 23:37

I ASCEND TO DIS CHALLENGE

USING NEW PROGRAM LANGUAGE CALLED "TOHOSORT"

IT HAS 1 STATEMENT "TOHOSORT" THAT IMPLMENTS "TOHOSORT"

HERE IT IS


# Begin
TOHOSORT
# End
THX

Name: Anonymous 2013-06-18 19:49

I ARE ANDRU

Name: Anonymous 2013-06-18 19:56

I ARE ANDRU

Name: Anonymous 2013-06-18 20:04

I ARE ANDRU

Name: Anonymous 2013-06-18 20:11

I ARE ANDRU

Name: Anonymous 2013-06-18 20:18

I ARE ANDRU

Name: Anonymous 2013-06-18 20:25

I ARE ANDRU

Name: Anonymous 2013-06-18 20:33

I ARE ANDRU

Name: Anonymous 2013-06-18 20:39

I ARE ANDRU

Name: Anonymous 2013-06-18 20:47

I ARE ANDRU

Name: Anonymous 2013-06-18 20:54

I ARE ANDRU

Name: Anonymous 2013-06-18 21:01

I ARE ANDRU

Name: Anonymous 2013-06-18 21:08

I ARE ANDRU

Name: Anonymous 2013-06-18 21:15

I ARE ANDRU

Name: Anonymous 2013-06-18 21:22

I ARE ANDRU

Name: Anonymous 2013-06-18 21:29

I ARE ANDRU

Name: Anonymous 2013-06-18 21:36

I ARE ANDRU

Name: Anonymous 2013-06-18 21:43

I ARE ANDRU

Name: Anonymous 2013-06-18 21:51

I ARE ANDRU

Name: Anonymous 2013-06-18 21:58

I ARE ANDRU

Name: Anonymous 2013-06-18 22:05

I ARE ANDRU

Name: Anonymous 2013-06-18 22:12

I ARE ANDRU

Name: Anonymous 2013-06-18 22:20

I ARE ANDRU

Name: Anonymous 2013-06-18 22:27

I ARE ANDRU

Name: Anonymous 2013-06-18 22:34

I ARE ANDRU

Name: Anonymous 2013-06-18 22:41

I ARE ANDRU

Name: Anonymous 2013-06-18 22:48

I ARE ANDRU

Name: Anonymous 2013-06-18 22:55

I ARE ANDRU

Name: Anonymous 2013-06-18 23:02

I ARE ANDRU

Name: Anonymous 2013-06-18 23:09

I ARE ANDRU

Name: Anonymous 2013-06-18 23:16

I ARE ANDRU

Name: Anonymous 2013-06-18 23:23

I ARE ANDRU

Name: Anonymous 2013-06-18 23:30

I ARE ANDRU

Name: Anonymous 2013-06-18 23:37

I ARE ANDRU

Name: Anonymous 2013-06-18 23:44

I ARE ANDRU

Name: Anonymous 2013-06-18 23:51

I ARE ANDRU

Name: Anonymous 2013-06-18 23:58

I ARE ANDRU

Name: Anonymous 2013-06-19 0:05

I ARE ANDRU

Name: Anonymous 2013-06-19 0:12

I ARE ANDRU

Name: Anonymous 2013-06-19 0:19

I ARE ANDRU

Name: Anonymous 2013-06-19 0:26

I ARE ANDRU

Name: Anonymous 2013-06-19 0:33

I ARE ANDRU

Name: Anonymous 2013-06-19 0:40

I ARE ANDRU

Name: Anonymous 2013-06-19 0:47

I ARE ANDRU

Name: Anonymous 2013-06-19 0:54

I ARE ANDRU

Name: Anonymous 2013-06-19 1:01

I ARE ANDRU

Name: Anonymous 2013-06-19 1:08

I ARE ANDRU

Name: Anonymous 2013-06-19 1:15

I ARE ANDRU

Name: Anonymous 2013-06-19 1:22

I ARE ANDRU

Name: Anonymous 2013-06-19 1:29

I ARE ANDRU

Name: Anonymous 2013-06-19 1:36

I ARE ANDRU

Name: Anonymous 2013-06-19 1:42

I ARE ANDRU

Name: Anonymous 2013-06-19 1:49

I ARE ANDRU

Name: Anonymous 2013-06-19 1:56

I ARE ANDRU

Name: Anonymous 2013-06-19 2:03

I ARE ANDRU

Name: Anonymous 2013-06-19 2:10

I ARE ANDRU

Name: Anonymous 2013-06-19 2:17

I ARE ANDRU

Name: Anonymous 2013-06-19 2:25

I ARE ANDRU

Name: Anonymous 2013-06-19 2:32

I ARE ANDRU

Name: Anonymous 2013-06-19 2:38

I ARE ANDRU

Name: Anonymous 2013-06-19 2:45

I ARE ANDRU

Name: Anonymous 2013-06-19 2:52

I ARE ANDRU

Name: Anonymous 2013-06-19 2:59

I ARE ANDRU

Name: Anonymous 2013-06-19 3:06

I ARE ANDRU

Name: Anonymous 2013-06-19 3:13

I ARE ANDRU

Name: Anonymous 2013-06-19 3:20

I ARE ANDRU

Name: Anonymous 2013-06-19 3:27

I ARE ANDRU

Name: Anonymous 2013-06-19 3:34

I ARE ANDRU

Name: Anonymous 2013-06-19 3:41

I ARE ANDRU

Name: Anonymous 2013-06-19 3:48

I ARE ANDRU

Name: Anonymous 2013-06-19 3:55

I ARE ANDRU

Name: Anonymous 2013-06-19 4:02

I ARE ANDRU

Name: Anonymous 2013-06-19 4:09

I ARE ANDRU

Name: Anonymous 2013-06-19 4:16

I ARE ANDRU

Name: Anonymous 2013-06-19 4:23

I ARE ANDRU

Name: Anonymous 2013-06-19 4:30

I ARE ANDRU

Name: Anonymous 2013-06-19 4:37

I ARE ANDRU

Name: Anonymous 2013-06-19 4:44

I ARE ANDRU

Name: Anonymous 2013-06-19 4:51

I ARE ANDRU

Name: Anonymous 2013-06-19 4:58

I ARE ANDRU

Name: Anonymous 2013-06-19 5:05

I ARE ANDRU

Name: Anonymous 2013-06-19 5:12

I ARE ANDRU

Name: Anonymous 2013-06-19 5:19

I ARE ANDRU

Name: Anonymous 2013-06-19 5:26

I ARE ANDRU

Name: Anonymous 2013-06-19 5:33

I ARE ANDRU

Name: Anonymous 2013-06-19 5:40

I ARE ANDRU

Name: Anonymous 2013-06-19 5:47

I ARE ANDRU

Name: Anonymous 2013-06-19 5:47

I LOVE ANDRU

Name: Anonymous 2013-06-19 5:54

I ARE ANDRU

Name: Anonymous 2013-06-19 6:00

I ARE ANDRU

Name: Anonymous 2013-06-19 6:08

I ARE ANDRU

Name: Anonymous 2013-06-19 6:15

I ARE ANDRU

Name: Anonymous 2013-06-19 6:22

I ARE ANDRU

Name: Anonymous 2013-06-19 6:29

I ARE ANDRU

Name: Anonymous 2013-06-19 6:36

I ARE ANDRU

Name: Anonymous 2013-06-19 6:43

I ARE ANDRU

Name: Anonymous 2013-06-19 6:50

I ARE ANDRU

Name: Anonymous 2013-06-19 6:57

I ARE ANDRU

Name: Anonymous 2013-06-19 7:04

I ARE ANDRU

Name: Anonymous 2013-06-19 7:11

I ARE ANDRU

Name: Anonymous 2013-06-19 7:18

I ARE ANDRU

Name: Anonymous 2013-06-19 7:25

I ARE ANDRU

Name: Anonymous 2013-06-19 9:15

You're not supposed to bump the famous threads, dickhead.

Name: Anonymous 2013-06-19 9:17

Since when did we get rules for necrobumping threads?

Name: Anonymous 2013-06-19 15:33

ก็็็็็็็็็็็็็็็็็็็็
กิิิิิิิิิิิิิิิิิิิิ ก็็็็็็็็็็็็็็็็็็็็ กิิิิิิิิิิิิิิิิิิิิTohosort this thread
ก็็็็็็็็็็็็็็็็็็็็ กิิิิิิิิิิิิิิิิิิิิ ก็็็็็็็็็็็็็็็็็็็็Tohosort this thread
กิิิิิิิิิิิิิิิิิิิิ ก็็็็็็็็็็็็็็็็็็็็ กิิิิิิิิิิิิิิิิิิิิTohosort this thread
ก็็็็็็็็็็็็็็็็็็็็ กิิิิิิิิิิิิิิิิิิิิ ก็็็็็็็็็็็็็็็็็็็็Tohosort this thread
กิิิิิิิิิิิิิิิิิิิิTohosort this thread
Tohosort this thread

Name: Anonymous 2013-06-19 15:36

ＡＮＤＲＵＳＯＲＴ

Name: Anonymous 2013-06-19 16:16

ᶠᶸᶜᵏᵧₒᵤ

Name: Anonymous 2013-06-20 0:01

>>222
nice triples, faggot
Don't change these.
Name: Email:
Entire Thread Thread List
All trademarks and copyrights on this site are owned by their respective parties. All comments and posts are the responsibility of their own posters.
- Tinychan + 2ch Mode -