CS50 Shorts 试译表

此问卷处于停止状态,仅供浏览,请勿填写!
感谢你对传思字幕组 .translate() group 的兴趣,欢迎参加我们的试译! 
这是我们字幕组整理的字幕翻译原则,是新译者培训材料,试译之前请先查看哦!
https://github.com/athena-xcy/CS50-Study-Group/blob/master/translation-group/principles-of-subtitle-translation.md

更多例子的可以看这个,有上次试译的讲解,和往期翻译分享会的文稿:https://github.com/athena-xcy/CS50-Study-Group/tree/master/translation-group


*1.
姓名、昵称
*2.
微信号
3.
GitHub 账号 (邮箱或用户名)
*4.
你是新朋友还是老朋友?
*5.
你还记得最初你是从哪里看到这个组织的吗? 【多选题】
我们的试译视频是 Algorithms Summary

有关于这个视频的全部资源,包括各类格式的视频、字幕,也可以直接用后面给出的 YouTube 链接观看
https://cdn.cs50.net/2017/fall/shorts/algorithms_summary/

srt 格式的字幕可以直接用这个链接下载,文本编辑器,比如记事本,就可以打开:
https://cdn.cs50.net/2017/fall/shorts/algorithms_summary/lang/en/algorithms_summary.srt
*6.
试译例句一 https://www.youtube.com/watch?v=ktWL3nN38ZA&list=PLhQjrBD2T381k8ul4WQ8SQ165XqY149WW&t=1m6s
We swap adjacent pairs of elements if they are out of order, which effectively bubbles larger elements to the right, and at the same time it also begins
to move smaller elements to the left. The worst-case case run time of bubble sort is n squared.
*7.
试译例句二  https://www.youtube.com/watch?v=ktWL3nN38ZA&list=PLhQjrBD2T381k8ul4WQ8SQ165XqY149WW&t=4m14s
We might find it immediately the first time we make a division, but, again, remember that although binary search is substantially better than linear search by virtue of being log n versus n, you might have to go through the work of sorting your array first, which might make it less effective depending on the size of the iterating sorted.
8.
其他想分享的(个人介绍,相关问题,其他信息)
问卷正在加载中,请稍候...
如果由于网络原因导致此框一直不消失,请重新刷新页面!